1 #include <iostream>
 2 #include <cstdio>
 3 using namespace std;
 4 int map[1010][1010],node[1010],Min,n,a,b;
 5 const int INF=999999999;
 6 
 7 int prim()
 8 {
 9     int vis[1010]= {0};
10     int tm=1,m,s=0;
11     vis[tm]=1;
12     node[tm]=0;
13     for (int k=1; k<=n; k++)
14     {
15         Min=INF;
16         for (int i=1; i<=n; i++)
17             if (!vis[i])
18             {
19                 if (node[i]>map[tm][i])
20                     node[i]=map[tm][i];
21                 if (Min>node[i])
22                 {
23                     Min=node[i];
24                     m=i;
25                 }
26                 //s+=Min;
27             }
28         tm=m;
29         vis[m]=1;
30 
31     }
32     for (int i=1; i<=n; i++)
33         s+=node[i];
34     return s;
35 }
36 
37 int main ()
38 {
39     while (cin>>n)
40     {
41         //cout<<n<<endl;
42         for (int i=1; i<=n; i++)
43         {
44             node[i]=INF;
45             for (int j=1; j<=n; j++)
46                 map[i][j]=INF;
47         }
48         for (int i=1; i<=n; i++)
49         {
50             for (int j=1; j<=n; j++)
51             {
52                 cin>>map[i][j];
53             }
54         }
55         int q;
56         cin>>q;
57         while (q--)
58         {
59             cin>>a>>b;
60             map[a][b]=map[b][a]=0;
61         }
62         printf ("%d\n",prim());
63     }
64     return 0;
65 }