#include <bits/stdc++.h>
using namespace std;
#define   ll long long
#define ull unsigned ll
#define  pll pair<ll,ll>
#define   vl vector<ll>
#define vpll vector<pll>
#define  tll tuple<ll,ll,ll>
#define  vvl vector<vl>
#define   pb push_back
#define    all(x) (x).begin(),(x).end()
#define     sz(a) (ll) ((a).size())
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; } 
void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); }
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
 

void solve(){
    ll n; cin>>n;
    vpll cur(n);
    for(auto& [a,b]:cur){
        cin>>a>>b;
    } sort(all(cur));
    map<ll,ll> mp;
    for(ll i=0;i<n;++i){mp[cur[i].first]=i;} 
    ll q; cin>>q;
    vl rem(q);
    vector<vpll> reward(q), cost(n);
    queue<ll> Q;
    ll ans = 0;
    for(ll i=0;i<q;++i){
        ll cnt; cin>>cnt;
        rem[i] = cnt;
        if(!cnt) Q.push(i),ans++;
        for(ll j=0;j<cnt;++j){
            ll a,b; cin>>a>>b;
            cost[mp[a]].pb({b,i});
        } 
        cin>>cnt;
        reward[i].resize(cnt);
        for(auto& [a,b]:reward[i]){ cin>>a>>b; a= mp[a]; } 
    } 
    vector<queue<pll>> cq(n);
    for(ll i=0;i<n;++i){
        auto &vv = cost[i];
        auto &qq = cq[i];
        sort(all(vv));
        for(auto j:vv) qq.push(j);
    } 
    do {
        // update
        while(Q.size()){
            ll i = Q.front(); Q.pop();
            for(auto [a,b]:reward[i]){
                cur[a].second+=b;
            }
        }
        // get
        for(ll i=0;i<n;++i){
            ll me = cur[i].second;
            auto &qq = cq[i];
            while(qq.size()){
                auto [x,j] = qq.front();
                if(x>me) break;
                qq.pop();
                if(!--rem[j])Q.push(j),ans++;
            }
        } 
    } while(Q.size());
    cout<<ans<<'\n';
}

int main(){
    ios::sync_with_stdio(0);cin.tie(0);
    ll t=1;
    while(t-->0){ solve();cerr<<"⋆⇝\n";}
}