{"trustable":false,"sections":[{"title":"","value":{"format":"MD","content":"N个点,M条边,每条边有权值。求一条1号点到N号点的路径,要求使得路径中的边权最小值最大。"}},{"title":"Input","value":{"format":"MD","content":"多组输入,第一行给一个**T**。\n每一组第一行给两个数n和m。**(1 \u003c\u003d n \u003c\u003d 1000)**\n接下来m行,每行三个数u,v,w代表路径的两个端点与边权。\n**(1 \u003c\u003d u,v \u003c\u003d n , 0\u003c w \u003c\u003d 1e6)**\n保证两点间只有一条边,该图为无向图。"}},{"title":"Output","value":{"format":"MD","content":"第i组数据先输出 \"Scenario #i:\"\n然后输出该路径上的最小边权,输出一个空行结束。\n保证有解\n"}},{"title":"Sample Input","value":{"format":"MD","content":"1\n3 3\n1 2 3\n1 3 4\n2 3 5"}},{"title":"Sample Output","value":{"format":"MD","content":"Scenario #1:\n4"}}]}