#include <bits/stdc++.h>
using namespace std;
int g,a,b,n,m,k,ans;
void solve()
{
	map<int,int>h;
	map<int,vector<pair<int,int>>>ne,re;
	cin>>g;
	while(g--)
	{
		cin>>a>>b;
		h[a]+=b;
	}
	cin>>n;
	vector<int>in(n+1);
	queue<int>q;
	for(int i=1;i<=n;i++)
	{
		cin>>m;
		while(m--)
		{
			cin>>a>>b;
			if(h[a]>=b) continue;
			ne[a].push_back({b,i});//ÐèÇó 
			in[i]++;//¶ÈÊý++ 
		}
		cin>>k;
		while(k--)
		{
			cin>>a>>b;
			re[i].push_back({a,b});//½±Àø 
		}
		if(in[i]==0) q.push(i);
	}

	ans=q.size();
	while(q.size())
	{
		int i=q.front();
		q.pop();
	//	cout<<i<<"\n";
		for(auto j:re[i]) 
		{
			a=j.first;
			b=j.second;
			h[a]+=b;
			for(auto k:ne[a])
			{
				if(k.second==0) continue;
				if(h[a]>=k.first)
				{
					in[k.second]--;
					if(!in[k.second]) 
					{
						q.push(k.second);
						k.second=1;
						ans++;
					}
				}
			}
		}
	}
	cout<<ans<<"\n";
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	int T=1;
	//cin>>T;
	while(T--) solve();
}