#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include <cmath>

 #include<stack>

 #include<vector>

 #include<map>

 #include<set>

 #include<queue>

 #include<algorithm>

 #define mod=1e9+7;

 using namespace std;

 typedef long long LL;

 const int INF = 0x7fffffff;

 const int maxn=;

 int d[maxn][maxn];

 int main(){

     int n,m,q,i,j,k,kase=,u,v,w;

     while(scanf("%d %d %d",&n,&m,&q)!=EOF&&n&&m&&q){

         for(i=;i<=n;i++){

             for(j=;j<=n;j++){

                 if(i==j) d[i][j]=;

                 else d[i][j]=INF;

             }

         }

         for(i=;i<=m;i++){

             scanf("%d %d %d",&u,&v,&w);

             d[u][v]=w;//无 向图，所以两个方向都赋上权值

             d[v][u]=w;

         }

         for(k=;k<=n;k++)

          for(i=;i<=n;i++)

           for(j=;j<=n;j++)

               d[i][j]=min(d[i][j],max(d[i][k],d[k][j]));

             if(kase) printf("\n");

             printf("Case #%d\n",++kase);

            while(q--){

                int x,y;

                scanf("%d %d",&x,&y);

                if(d[x][y]!=INF)     printf("%d\n",d[x][y]);

                else printf("no path\n");

            }

     }

     return ;

 }