English translate

Background
Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whether there really is a way from the place his customer has build his giant steel crane to the place where it is needed on which all streets can carry the weight.
Fortunately he already has a plan of the city with all streets and bridges and all the allowed weights.Unfortunately he has no idea how to find the the maximum weight capacity in order to tell his customer how heavy the crane may become. But you surely know.

Problem
You are given the plan of the city, described by the streets (with weight limits) between the crossings, which are numbered from 1 to n. Your task is to find the maximum weight that can be transported from crossing 1 (Hugo's place) to crossing n (the customer's place). You may assume that there is at least one path. All streets can be travelled in both directions.

输入

The first line contains the number of scenarios (city plans). For each city the number n of street crossings (1 <= n <= 1000) and number m of streets are given on the first line. The following m lines contain triples of integers specifying start and end crossing of the street and the maximum allowed weight, which is positive and not larger than 1000000. There will be at most one street between each pair of crossings.

输出

The output for every scenario begins with a line containing "Scenario #i:", where i is the number of the scenario starting at 1. Then print a single line containing the maximum allowed weight that Hugo can transport to the customer. Terminate the output for the scenario with a blank line.

背景
Hugo Heavy 很高兴。在 Cargolifter 项目崩溃后，他现在可以扩展业务。但是他需要一个聪明的人来告诉他是否真的有一条路可以从他的客户建造他的巨型钢起重机的地方到所有街道都可以承受重量的地方。
幸运的是，他已经制定了城市规划，包括所有街道和桥梁以及所有允许的重量。不幸的是，他不知道如何找到最大承重能力，以便告诉客户起重机可能会变得多重。但你肯定知道。

问题
你会得到城市的平面图，由交叉口之间的街道（有重量限制）描述，从 1 到 n 编号。你的任务是找出从 1 号路口（雨果所在的地方）到 n 号路口（客户所在的地方）可以运输的最大重量。您可以假设至少有一条路径。所有街道都可以双向行驶。
输入
第一行包含场景的数量（城市规划）。对于每个城市，街道交叉口的数量 n (1 <= n <= 1000) 和街道数量 m 在第一行给出。以下 m 行包含整数的三元组，指定街道的起点和终点交叉口以及最大允许权重，为正且不大于 1000000。每对交叉口之间最多有一条街道。
输出
每个场景的输出都以包含“场景 #i:”的行开头，其中 i 是场景的编号，从 1 开始。然后打印一行，其中包含 Hugo 可以运输给客户的最大允许重量。用空行终止场景的输出。