Not The Best

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define MX (5000)
int cn[2][MX];
struct eg{
    eg(int V,int T):v(V),t(T){}
    int v,t;
    bool operator<(const eg&r)const{return v>r.v;}
};
vector<int> g[MX],v[MX];
bool ad(int u,int v){
    if(cn[0][u]==v)return 0;
    if(!~cn[0][u]||cn[0][u]>v)return cn[1][u]=cn[0][u],cn[0][u]=v,1;
    if(!~cn[1][u]||cn[1][u]>v)return cn[1][u]=v,1;
    return 0;
}
int dj(int f,int t){
    priority_queue<eg> q;
    q.push(eg(0,f)),CL(cn,-1);
    while(!q.empty()){
        int a(q.top().t),w(q.top().v);
        q.pop();
        if(!ad(a,w))continue;
        for(int i(0);i<(int)g[a].size();++i)
            q.push(eg(w+v[a][i],g[a][i]));
    }
    return cn[1][t];
}
#define ADD(A,B,V) (g[A].push_back(B),g[B].push_back(A),v[A].push_back(V),v[B].push_back(V))
int main(void){
    int a,b,c,N,M;
    IN(tt)F(tt){
        scanf("%d%d",&N,&M);
        F(N)g[i].clear(),v[i].clear();
        F(M)scanf("%d%d%d",&a,&b,&c),--a,--b,ADD(a,b,c);
        printf("Case %d: %d\n",i+1,dj(0,N-1));
    }
    return 0;
}