#include <algorithm>
#include <bits/stdc++.h>
#define ll long long
#define pr priority_queue<int,vector<int> ,greater<int> >
using namespace std;
const ll MAX_INT=0x7f7f7f7f;
ll n, m, a[105][4505], u[15], v[15], as=1e15;
void floyd(){
	for (int k=1;k<=n;k++) for (int i=1;i<=n;i++) for (int j=1;j<=n;j++)
		if (a[i][k]!=MAX_INT&&a[k][j]!=MAX_INT&&a[i][k]+a[k][j]<a[i][j]) a[i][j] = a[i][k]+a[k][j];
}
void f(int x,int y,ll z){
	if (y==m){
		as = min(as,z+a[x][n]);
		return ;
	}
	for (int i=1;i<=m;i++) if (!v[i]){
		v[i] = 1;
		f(u[i],y+1,z+a[x][u[i]]);
		v[i] = 0;
	}
}
int main(){
	cin >> n;
	for (int i=1;i<=n;i++) for (int j=1;j<=n;j++) cin >> a[i][j];
	for (int i=1;i<=n;i++) for (int j=1;j<=n;j++) if (i!=j&&!a[i][j]) a[i][j] = MAX_INT;
	floyd();
	cin >> m;
	for (int i=1;i<=m;i++) cin >> u[i];
	f(1,0,0);
	if (as==1) cout << 0;
	cout << as;
	return 0;
}