1 #include<iostream>
 2 #include<cstdio>
 3 #include<algorithm>
 4 using namespace std;
 5 int co[601],ra[600][100001];
 6 long long sum;
 7 int main()
 8 {
 9     int n,m,i,j,a,b,c,tm1,tm2;
10     scanf("%d",&n);
11     for(i=1;i<=n;i++){
12         scanf("%d",&m);
13         for(j=1;j<=m;j++){
14             scanf("%d%d",&a,&b);
15             co[a-200]+=b;
16         }
17     }
18     scanf("%d",&c);
19     for(i=1;i<=c;i++){
20         scanf("%d%d",&tm1,&tm2);
21         ra[tm1-200][0]++;
22         ra[tm1-200][ra[tm1-200][0]]=tm2;
23     }
24     for(i=0;i<=599;i++){
25         //printf("%d\n",co[i]);
26         if(ra[i][0]==0||co[i]==0)
27         continue;
28         sort(ra[i]+1,ra[i]+1+ra[i][0]);
29         for(j=1;j<=co[i];j++){
30             //printf("%d | %d\n",j,ra[i][j]);
31             sum=sum+ra[i][j];
32         }
33     }
34     printf("%I64d\n",sum);
35     //printf("%d\n",clock());
36     return 0;
37 
38 
39 }
40