#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);
	}
	for(auto i:ne) sort(i.second.begin(),i.second.end());
	ans=q.size();
	while(q.size())
	{
		int i=q.front();
		q.pop();
		for(auto j:re[i]) 
		{
			a=j.first;
			b=j.second;
			h[a]+=b;
			for(int k=0;k<ne[a].size();k++)
			{
				if(h[a]>=ne[a][k].first) 
				{
					in[ne[a][k].second]--;
					if(in[ne[a][k].second]==0) 
					{
						q.push(in[ne[a][k].second]);
						ans++;
					}
				}
				else
				{
					vector<pair<int,int>>v;
					for(int k1=k;k1<ne[a].size();k1++) v.push_back(ne[a][k1]);
					ne[a]=v;
					break;
				}
			}
		}
	}
	cout<<ans<<"\n";
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	int T=1;
	//cin>>T;
	while(T--) solve();
}