#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define int long long
const int N = 3e5+5;
int g,n,id,num[N],diff[N];
bool vis[N];
unordered_map<int,int> mp;
vector<pair<int,int>> G[N];
vector<pair<int,int>> rec[N];

signed main()
{
    cin.tie(0),cout.tie(0),ios::sync_with_stdio(false);
    cin>>g;
    for(int i = 1;i<=g;i++){
        int t,u;
        cin>>t>>u;
        mp[t] = ++id;
        num[id] = u;
    }
    cin>>n;
    for(int i = 1;i<=n;i++){
        int m;cin>>m;
        while(m--){
            int a,b;
            cin>>a>>b;
            if(!mp[a]) mp[a] = ++id;
            if(num[mp[a]]<b){
                diff[i]++;
                G[mp[a]].push_back({i,b});
            }
        }
        int k;cin>>k;
        while(k--){
            int c,d;
            cin>>c>>d;
            rec[i].push_back({c,d});
        }
    }
    queue<int> q;
    for(int i = 1;i<=n;i++) if(diff[i]==0) q.push(i);
    int ans = 0;
    while(true){
        bool ok = false;
        unordered_map<int,int> m;
        while(!q.empty()){
            int x = q.front();q.pop();
            if(vis[x]) continue;
            ans++;
            vis[x] = true;
            for(auto&& it:rec[x]){
                int a = it.first,b = it.second;
                m[a] += b;
            }
        }
        for(auto&& it:m){
            int a = it.first,b = it.second;
            if(!mp[a]) mp[a] = ++id;
            int last = num[mp[a]];
            num[mp[a]]+=b;
            for(auto&& z:G[mp[a]]){
                int c = z.first,d = z.second;
                if(d==-1) continue;
                if(d<=num[mp[a]]){
                    z.second = -1;
                    diff[c]--;
                    if(diff[c]==0){
                        q.push(c);
                        ok = true;
                    }
                }
            }
        }
        if(!ok) break;
    }
    cout<<ans<<endl;
    // return 0;
}