#include<bits/stdc++.h>
//#define int long long
using namespace std;
const int maxn=1e3+10;
const int inf=1e7;
int edge[maxn][maxn];
bool vis[maxn];//0 不用访问 1 需要访问 
int n,p,ans=inf;
void dfs(int pl,int wp,int va){//pl 所处位置 wp 已访问个数 va 价值 
	if(wp==0){
		ans=min(ans,va+edge[pl][n]);
		//cout<<va+edge[pl][n]<<endl;
		return;
	}
	for(int i=1;i<=n;i++){
		if(vis[i]==1){
			vis[i]=0;
			dfs(i,wp-1,va+edge[pl][i]);
			vis[i]=1;
		}
	}
	return;
}
signed main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			scanf("%d",&edge[i][j]);
		}
	}
	for(int k=1;k<=n;k++){
		for(int x=1;x<=n;x++){
			for(int y=1;y<=n;y++){
				edge[x][y]=min(edge[x][y],edge[x][k]+edge[k][y]);
			}
		}
	}
	scanf("%d",&p);
	int del=0;
	for(int i=0;i<p;i++){
		int tmp;
		scanf("%d",&tmp);
		if(tmp==1||tmp==n) del++;
		else vis[tmp]=1;
	}
	dfs(1,p-del,0);
	cout<<ans<<endl;
	return 0;
}