/*
*****************************
* 作者:huzhaoxin            	*
* 努力加油,努力赚钱娶媳妇回家 	*
* 时时刻刻爱老婆            	*
*****************************
*/
#include<bits/stdc++.h>
#define all(x) x.begin(),x.end() 
#define endl "\n"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
const double eps = 1e-9;
const long long mod = 1e9 + 7;
const long long inf = 2e12 + 7;
/*---------------------------------------------------------------------------*/
void solve() {
	ll n;
	cin>>n;
	map<ll,ll>mp;
	for(int i=1;i<=n;i++){
		ll a,b;
		cin>>a>>b;
		mp[a]+=b;
	}
	cin>>n;
	vector<ll>cnt(n+1);
	set<pll>st[n+1];
	vector<vector<ll>>v(n+1);
	for(int i=1;i<=n;i++){
		ll m;
		cin>>m;
		for(int j=1;j<=m;j++){
			ll a,b;
			cin>>a>>b;
			if(mp[a]>=b)continue;
			else{
				cnt[i]++;
				st[a].insert({b,(ll)i});
				// cout<<a<<"--"<<b<<" "<<i<<endl;
			}
		}
		ll k;
		cin>>k;
		for(int j=1;j<=k;j++){
			ll a,b;
			cin>>a>>b;
			v[i].push_back(a);
			v[i].push_back(b);
		}
	}
	queue<ll>q;
	ll res=0;
	for(int i=1;i<=n;i++){
		if(cnt[i]==0){
			q.push(i);
		}
	}
	while(q.size()){
		ll tmp=q.front();
		q.pop();
		res++;
		for(int i=0;i<v[tmp].size();i+=2){
			ll a=v[tmp][i];
			ll b=v[tmp][i+1];
			// cout<<"<<"<<a<<" "<<b<<endl;
			ll now=mp[a]+b;
			mp[a]+=b;
			while(st[a].size()){
				auto it=*st[a].begin();
				// cout<<it.first<<" "<<it.second<<endl;
				if(it.first>now)break;
				st[a].erase(st[a].begin());
				cnt[it.second]--;
				if(cnt[it.second]==0)q.push(it.second);
			}
		}
	}
	cout<<res<<endl;
}
/*---------------------------------------------------------------------------*/
int main() {
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	ll T;
	// for (cin >> T; T; T--)
	solve();
	return 0;
}