#include <bits/stdc++.h>
using namespace std;

inline int read()
{
	int x=0,f=1,c=getchar();
	while(c<48) c=='-'&&(f=-1),c=getchar();
	while(c>47) x=x*10+c-'0',c=getchar();
	return x*f;
}

typedef long long ll;
typedef pair<ll,ll> pll;
const int MAXN = 500005;
std::vector<pll> req[MAXN],rwd[MAXN];
ll wcnt[MAXN],mcnt[MAXN],rwcnt[MAXN];
std::unordered_map<int,int> mp;
queue<ll> q;
ll n,g,ans,tot;

inline bool cmp(pll a,pll b)
{
	return a.first!=b.first ? a.first > b.first : a.second>b.second;
}

inline void checktype(ll t)
{
	ll top=req[t].size()-1;
	while(top && req[t][top].first<=wcnt[t])
	{
		ll proj=req[t][top].second;
		--mcnt[proj]; req[t].pop_back(); --top;
		if(mcnt[proj]==0) q.push(proj);
	}
}

inline void toposort()
{
	for(ll i=1; i<=tot; ++i) checktype(i);
	for(ll i=1; i<=n; ++i)
		if(mcnt[i]==0) q.push(i);
	while(!q.empty())
	{
		ll x=q.front(); q.pop(); ++ans;
		for(auto t : rwd[x])
		{
			wcnt[t.first]+=t.second;
			checktype(t.first);
		}
	}
}

int main(int argc, char const *argv[])
{
	g=read();
	for(ll i=1; i<=g; ++i)
	{
		ll t=read(),u=read();
		if(!mp[t]) mp[t]=++tot;
		wcnt[mp[t]]=u;
	}
	n=read();
	for(ll i=1; i<=n; ++i)
	{
		mcnt[i]=read();
		for(ll j=1; j<=mcnt[i]; ++j)
		{
			ll t=read(),u=read();
			if(!mp[t]) mp[t]=++tot;
			req[mp[t]].push_back(make_pair(u,i));
		}
		rwcnt[i]=read();
		for(ll j=1; j<=rwcnt[i]; ++j)
		{
			ll t=read(),u=read();
			if(!mp[t]) mp[t]=++tot;
			rwd[i].push_back(make_pair(mp[t],u));
		}
	}
	for(ll i=1; i<=tot; ++i)
		sort(req[i].begin(), req[i].end(), cmp);
	toposort();
	printf("%lld\n", ans);
	return 0;
}