#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<queue>
#include<vector>
using  namespace std;
#define maxn 100000000
int n,map[110][110],vis[110],low[110],q,minn,ans;
int prim()
{
int pos,result=0;
memset(vis,0,sizeof(vis));
vis[1]=1,pos=1;
for(int i=1;i<=n;i++)
if(pos!=i)
low[i]=map[pos][i];
for(int i=1;i<=n-1;i++)
{
minn=maxn;
for(int j=1;j<=n;j++)
{
if(vis[j]==0&&minn>low[j])
minn=low[j],pos=j;
}
result+=minn,vis[pos]=1;
for(int j=1;j<=n;j++)
if(vis[j]==0&&low[j]>map[pos][j])
low[j]=map[pos][j];
}
return result;
}
int main()
{
while(scanf("%d",&n)!=EOF)
{
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
scanf("%d",&map[i][j]);
scanf("%d",&q);
for(int i=1;i<=q;i++)
{
int x,y;
scanf("%d%d",&x,&y);
map[x][y]=map[y][x]=0;
}
ans=prim();
printf("%d\n",ans);
}
return 0;
}