#include <bits/stdc++.h>

 using namespace std;

 #define INF 1<<29

 #define repu(i,a,b) for(int i=a;i<b;i++)

 #define N 500

 int vis[N],p[N][N];

 int main()

 {

     int n,m,k,kase = ;

     while(scanf("%d%d%d",&m,&n,&k)&&m&&n&&k)

     {

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

         memset(vis,,sizeof(vis));

         int u,v,d,a,b,st,ed;

         repu(i,,m)

         {

             repu(j,,m)

             p[i][j] = INF;

             p[i][i]=;///坑啊，一定得记住啊

         }

         repu(i,,n)

         {

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

             if(p[u][v] > d)

                 p[u][v] = d;

         }

         while(k--)

         {

             scanf("%d",&a);

             if(a==)

             {

                 scanf("%d%d",&st,&ed);

                 if(!vis[st] || !vis[ed])

                     printf("City %d or %d is not available.\n",st,ed);

                 else

                 {

                     if(p[st][ed] != INF)

                         printf("%d\n",p[st][ed]);

                     else

                         printf("No such path.\n");

                 }

             }

             else

             {

                 scanf("%d",&b);

                 if(vis[b])

                     printf("City %d is already recaptured.\n",b);

                 else

                 {

                     vis[b] = ;

                     ///更新所有以b为过路点的最小值

                     repu(i,,m)

                     repu(q,,m)

                     p[i][q] = min(p[i][q],p[i][b]+p[b][q]);

                 }

             }

         }

         printf("\n");

     }

     return ;

 }