#include <stdio.h>
#include <string.h>
#define INF 100000000
#define MAX 110

int graph[MAX][MAX] ;

int prim(int n)
{
	int lowCost[MAX],closest[MAX];
	bool visited[MAX];
	memset(visited,false,sizeof(visited)) ;
	for(int i = 1 ; i <= n ; ++i)
	{
		lowCost[i] = graph[1][i] ;
		closest[i] = 1 ;
	}
	visited[1] = true ;
	int sum = 0 ;
	for(int i = 0 ; i < n-1 ; ++i)
	{
		int min = INF , index = -1 ;
		for(int j = 1 ; j <= n ; ++j)
		{
			if(!visited[j] && min>lowCost[j])
			{
				index = j ;
				min = lowCost[j] ;
			}
		}
		if(index == -1)
		{
			break ;
		}
		sum += lowCost[index] ;
		visited[index] = true ;
		for(int j = 1 ; j <= n ; ++j)
		{
			if(!visited[j] && lowCost[j]>graph[index][j])
			{
				lowCost[j] = graph[index][j] ;
				closest[j] = index ;
			}
		}
	}
	return sum ;
}

int main()
{
	int n ;
	while(~scanf("%d",&n))
	{
		for(int i = 1 ; i <= n ; ++i)
		{
			for(int j = 1 ; j <= n ; ++j)
			{
				int w ;
				scanf("%d",&w) ;
				graph[i][j] = w ;
			}
		}
		int q ;
		scanf("%d",&q);
		for(int i = 0 ; i < q ; ++i)
		{
			int x , y ;
			scanf("%d%d",&x,&y);
			graph[x][y] = graph[y][x] = 0 ;
		}
		int sum = prim(n) ;
		printf("%d\n",sum) ;
	}
	return 0 ;
}