#include<iostream>
#include<cstring>
using namespace std;
#define maxn 1005
#define inf 0x3f3f3f3f
int data[maxn][maxn],n,dis[maxn],vis[maxn];
int Dijsktra(){
    memset(vis,0,sizeof vis);
    for(int i=1;i<=n;i++){
        dis[i] = data[1][i];
    }
    dis[1] = 0;
    vis[1] = 1;
    for
 
(int i=1;i<n;i++){
        int maxdis = 0,tmp,t;
        for(int i=2;i<=n;i++){
            if(!vis[i]&&dis[i]>0&&dis[i]>maxdis){
                maxdis = dis[i];
                tmp = i;
            }
        }
//        cout<<tmp<<" "<<dis[tmp]<<endl; 
 

        vis[tmp] = 1;
        for(int i=1;i<=n;i++){
            t = -1;
            if(dis[tmp]>0&&data[tmp][i]>0){
                t = min(dis[tmp],data[tmp][i]);
            }
            if(t>0&&dis[i]<t){
                dis[i] = t;
            }
        }
//        for(int j=1;j<=n;j++){
 
//            cout<<dis[j]<<" ";
//        }
//        cout<<endl;
    }
    return dis[n];
}
int main(){
    int t,m,p,q,disPQ;
    scanf("%d",&t);
    for(int i=1;i<=t;i++){
        scanf("%d%d",&n,&m);
        memset(data,-1,sizeof data);
        for(int j=0;j<m;j++){
            scanf("%d%d%d",&p,&q,&disPQ);
            data[p][q] = data[q][p] = disPQ;
        }
        printf("Scenario #%d:\n",i);
        printf("%d\n\n",Dijsktra());
    }
    return 0;
}