#include <stdio.h>
#include <string.h>
#define M 100+10
#define INF 999999
int road[M][M];
int city[M];
int s[M];
int main()
{
	int n,m,i,j,k,sum,rec,max;
	scanf("%d",&n);
		for(i=1;i<=n;i++)
	{
	 getchar();
	 for(j=1;j<=n;j++)
	  scanf("%d",&road[i][j]);
	}
	scanf("%d",&m);
	for(k=1;k<=m;k++)
	{
	 scanf("%d %d",&i,&j);
	 road[i][j]=0;
	 road[j][i]=0;
	}
	memset(s,0,sizeof(s));
	for(i=1;i<=n;i++)
	city[i]=road[1][i];
	sum=0;
	s[1]=1;
	for(i=1;i<n;i++)
	{
		max=INF;
		for(j=1;j<=n;j++)
		if(!s[j]&&city[j]<max)
		{
			max=city[j];
			rec=j;
		}
		sum+=city[rec];
		s[rec]=1;
		for(j=1;j<=n;j++)
			if(!s[j]&&road[rec][j]<city[j])
				city[j]=road[rec][j];
	}
	printf("%d\n",sum);
	return 1;
}