#include<iostream>
#include<algorithm>
#include<map>
using namespace std;
int n,m,ans;
map<int,int> mp;
struct mbk{int kd,num;}sav[100010];
struct ofr{
    vector<mbk> sg;
    vector<mbk> rw;
    bool isq;
}lis[100010];
int main(){
    freopen("Cappuccino.in","r",stdin);
    freopen("Cappuccino.out","w",stdout);
    
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        int t,u;scanf("%d%d",&t,&u);
        sav[i].kd=t,sav[i].num=u;
    }
    scanf("%d",&m);
    for(int i=1;i<=m;i++){
        lis[i].isq=false;
        int sgn;scanf("%d",&sgn);
        while(sgn--){
            int t,u;scanf("%d%d",&t,&u);
            lis[i].sg.push_back((mbk){t,u});
            mp[t]=0;
        }
        int rwn;scanf("%d",&rwn);
        while(rwn--){
            int t,u;scanf("%d%d",&t,&u);
            lis[i].rw.push_back((mbk){t,u});
            mp[t]=0;
        }
    }
    for(int i=1;i<=n;i++) mp[sav[i].kd]=sav[i].num;
    
    while(true){
        bool skp=true;
        for(int p=1;p<=m;p++){
            if(lis[p].isq==true) continue;
            bool isf=true;
            for(int i=0;i<lis[p].sg.size()&&isf;i++) if(mp[lis[p].sg[i].kd]<lis[p].sg[i].num) isf=false;
            if(isf){
                for(int i=0;i<lis[p].rw.size();i++) mp[lis[p].rw[i].kd]+=lis[p].rw[i].num;
                skp=false;
                lis[p].isq=true;
                ans++;
            }
        }
        if(skp) break;
    }
    printf("%d",ans);
    
    return 0;
}