#include<iostream>

 #include<algorithm>

 #include<cstring>

 #include<cstdio>

 #include<sstream>

 #include<vector>

 #include<stack>

 #include<queue>

 #include<cmath>

 #include<map>

 #include<set>

 using namespace std;

 typedef long long ll;

 typedef pair<int,int> pll;

 const int INF = 0x3f3f3f3f;

 const int maxn =  + ;

 int n, m;

 int val[maxn];

 int mp[maxn][maxn];

 int path[maxn][maxn];

 void floyd()

 {

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

     {

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

         {

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

             {

                 if(mp[i][k]==INF || mp[k][j]==INF)  continue;

                 int sum=mp[i][k]+mp[k][j]+val[k];

                 if(mp[i][j]>sum)

                 {

                     mp[i][j]=sum;

                     path[i][j]=path[i][k];

                 }

                 else if(mp[i][j]==sum && path[i][j]>path[i][k])

                     path[i][j]=path[i][k];

             }

         }

     }

 }

 int main()

 {

     //freopen("in.txt","r",stdin);

     while(~scanf("%d",&n) && n)

     {

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

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

         {

             scanf("%d",&mp[i][j]);

             if(mp[i][j]==-)   mp[i][j]=INF;

             path[i][j]=j;  //i的后继路径为j

         }

         for(int i=;i<=n;i++)  scanf("%d",&val[i]);

         floyd();

         while(true)

         {

             int s,t;

             scanf("%d%d",&s,&t);

             if(s==- && t==-)  break;

             printf("From %d to %d :\n",s,t);

             printf("Path: %d",s);

             int tmp=s;

             while(tmp!=t)

             {

                 printf("-->%d",path[tmp][t]);

                 tmp=path[tmp][t];

             }

             printf("\n");

             printf("Total cost : %d\n\n",mp[s][t]);

         }

     }

     return ;

 }