// Problem: B. Building Company
// Contest: Codeforces - The 13th Shandong ICPC Provincial Collegiate Programming Contest
// URL: https://codeforces.com/gym/104417/problem/B
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using PII = pair<ll,ll>;
using VVI = vector<vector<int>>;
const ll mod = 998244353;
const ll INF = 1e18;
const int N = 2e5 + 10;
using pq = priority_queue<PII , vector<PII> , greater<>>;
map<ll,ll>have;
ll need[N];
ll k[N];
ll g,n;
map<ll,ll> off[N];
map<ll , pq> p;
queue<ll> q;
void add(int pj){
	for(auto [t , v] : off[pj]){
		have[t] += v;
		while(p[t].size() && p[t].top().first <= have[t]){
			need[p[t].top().second]--;
			if(need[p[t].top().second] == 0) q.push(p[t].top().second);
			p[t].pop();
		}	
	}
	
	
	
}

int main() {
	ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin>>g;
    for(int i = 1 ; i <= g ; i++){
    	ll t,v;
    	cin>>t>>v;
    	//cout<<t<<v<<" ";
    	off[0][t] += v;
    }
    cin>>n;
    //cout<<n;
    for(int i = 1 ; i <= n ; i++){
    	cin>>need[i];
    	//cout<<need[i]<<"\n";
    	for(int j = 1 ; j <= need[i] ; j++){
			ll a,b;
			cin>>a>>b;
			p[a].push({b , i});
    	}
    	cin>>k[i];
    	for(int j = 1 ; j <= k[i] ; j++){
    		ll c,d;
    		cin>>c>>d;
    		off[i][c] += d;
    	}
    }
    
    
    int res = 0;
    /*for(auto [x,v] : have){
    	cout<<x<<" "<<v<<"\n";
    }
    */
    for(int i = 1 ; i <= n ; i++){
    	if(need[i] == 0) {
    		add(i);
    		res++;
    		//cout<<i<<" ";
    	}
    	
    }
    add(0);
    //cout<<endl;
    while(q.size()){
    	auto u = q.front();
    	//cout<<u<<" ";
    	res++;
    	q.pop();
    	add(u);
    }    
    
    
    
    
    
    cout<<res;
    
    
    
}


//5 4 3 2 1
//5 4 3 2 1