1 #include <stdio.h>
 2 #include <string.h>
 3 #define inf 0x3f3f3f3f
 4 
 5 int map[110][110],vis[110],dis[110];
 6 int n;
 7 
 8 void prim()
 9 {
10     int i,j,pos,min,sum = 0;
11     for (i = 1; i <= n; i ++)
12     {
13         vis[i] = 0;
14         dis[i] = map[1][i];
15     }
16     vis[1] = 1; dis[1] = 0;
17     for (i = 1; i < n; i ++)
18     {
19         pos = -1; min = inf;
20         for (j = 1; j <= n; j ++)
21         {
22             if (!vis[j] && min > dis[j])
23             {
24                 min = dis[j];
25                 pos = j;
26             }
27         }
28         vis[pos] = 1;
29         sum += min;
30         for (j = 1; j <= n; j ++)
31             if (!vis[j] && dis[j] > map[pos][j])
32                 dis[j] = map[pos][j];
33     }
34     printf("%d\n",sum);
35 }
36 int main ()
37 {
38     int i,j,m,a,b;
39     while (~scanf("%d",&n))
40     {
41         for (i = 1; i <= n; i ++)
42         for (j = 1; j <= n; j ++)
43             scanf("%d",&map[i][j]);
44         scanf("%d",&m);
45         for (i = 0; i < m; i ++)
46         {
47             scanf("%d%d",&a,&b);
48             map[a][b] = map[b][a] = 0;
49         }
50         prim();
51     }
52     return 0;
53 }