#include<bits/stdc++.h>
#define fir first
#define sec second
using namespace std;
typedef long long ll;
constexpr int M=2e5+5;ll add[M];queue<pair<int,int>>q;
vector<pair<int,int>>pos[M],qry[M],upd[M];
int n,m,k,num,ans,a[M],b[M],lsh[M],buc[M],head[M];
int read(){
	int x=0;char ch=getchar();
	while (!isdigit(ch)) ch=getchar();
	while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
	return x;
}
int main(){ n=read();
	for (int i=1;i<=n;i++) a[i]=read(),b[i]=read(),lsh[++num]=a[i];
	m=read(); for (int i=1;i<=m;i++){
		k=read();while (k--) qry[i].push_back({read(),read()}),lsh[++num]=qry[i].back().fir;
		k=read();while (k--) upd[i].push_back({read(),read()}),lsh[++num]=upd[i].back().fir;
	}
	sort(lsh+1,lsh+num+1);num=unique(lsh+1,lsh+num+1)-lsh-1;
	for (int i=1;i<=n;i++) a[i]=lower_bound(lsh+1,lsh+num+1,a[i])-lsh;
	for (int i=1;i<=m;i++){
		for (auto &[x,y]:qry[i]) x=lower_bound(lsh+1,lsh+num+1,x)-lsh,pos[x].push_back({y,i}),buc[i]++;
		for (auto &[x,y]:upd[i]) x=lower_bound(lsh+1,lsh+num+1,x)-lsh;
	}
	for (int i=1;i<=num;i++) sort(pos[i].begin(),pos[i].end());
	for (int i=1;i<=n;i++) q.push({a[i],b[i]});
	for (int i=1;i<=m;i++)
		if (!buc[i]){ ans++;
			for (auto x:upd[i])
				q.push(x);
			}
	while (!q.empty()){
		pair<int,int> x=q.front();q.pop();add[x.fir]+=x.sec;
		while (head[x.fir]<pos[x.fir].size()&&pos[x.fir][head[x.fir]].fir<=add[x.fir]){
			int tmp=pos[x.fir][head[x.fir]].sec;
			if (!--buc[tmp]){ ans++;
				for (auto x:upd[tmp]) q.push(x);
			}
			head[x.fir]++;
		}
	}
	printf("%d\n",ans);
	return 0;
}