#include <cstdio>
#include <cstring>
#include <iostream>

const int INF = 999999999;
const int MAXN=105;
int n,path[MAXN][MAXN],charge[MAXN],W[MAXN][MAXN];
int x,y;

void init(){
    for(int i=0;i<=n;i++)
        for(int j=0;j<=n;j++){
            if(i!=j) W[i][j] = INF;
            else W[i][j] = 0;
            path[i][j]=j;
        }
}

void floyd(){
    for(int k=1;k<=n;k++)
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
            if(W[i][k]!=INF && W[k][j]!=INF){
                int ans = W[i][k]+W[k][j]+charge[k];
                if(W[i][j]>ans){
                    W[i][j] = ans;
                    path[i][j] = path[i][k];
                }
                else if(W[i][j]==ans && path[i][j]>path[i][k]){
                    path[i][j] = path[i][k];
                }
            }
}

int main(){
    while( scanf("%d",&n) && n){
        init();
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++){
                scanf("%d",&W[i][j]);
                if(W[i][j]==-1) W[i][j] = INF;
            }
        for(int i=1;i<=n;i++) scanf("%d",&charge[i]);
        floyd();
        while( scanf("%d%d",&x,&y) && (x!=-1 && y!=-1) ){
            printf("From %d to %d :\n",x,y);
            printf("Path: ");
            int u = x;
            printf("%d",u);
            while(u!=y){
                printf("-->%d",path[u][y]);
                u = path[u][y];
            }
            puts("");
            printf("Total cost : %d\n\n",W[x][y]);
        }    
    }
    return 0;
}