#include<iostream>
#include<queue>
#include<cstring>
#include<algorithm>
#include<vector>
#include<cstdio>
#define INF 1000006
#define MAX_N 1003
using namespace std;

int d[MAX_N];
int T;

struct node {
public:
    int u, c;

    node(int uu, int cc) : u(uu), c(cc) { }

    node() { }
};

struct edge {
public:
    int to, cost;

    edge(int t, int c) : to(t), cost(c) { }

    edge() { }
};

queue<node> que;
vector<edge> G[MAX_N];
void spfa(int s) {
    que.push(node(s, INF));
    d[s] = INF;
    while (que.size()) {
        node now = que.front();
        que.pop();
        if (now.c != d[now.u])continue;
        int u = now.u;
        for (int i = 0; i < G[u].size(); i++) {
            int v = G[u][i].to;
            int t = min(d[u], G[u][i].cost);
            if (t > d[v]) {
                d[v] = t;
                que.push(node(v, t));
            }
        }
    }
}
int n,m;

int main() {
    scanf("%d", &T);
    int cas = 0;
    while (T--) {
        scanf("%d%d", &n, &m);
        for (int i = 0; i <= n; i++)G[i].clear();
        while (que.size())que.pop();
        memset(d, 0, sizeof(d));
        for (int i = 0; i < m; i++) {
            int u, v, c;
            scanf("%d%d%d", &u, &v, &c);
            G[u].push_back(edge(v, c));
            G[v].push_back(edge(u, c));
        }
        spfa(1);
        printf("Scenario #%d:\n%d\n\n", ++cas, d[n]);
    }
    return 0;
}