#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mxn = 300005;
vector<set<pair<int,int>>>tasks(mxn);
vector<int>rem(mxn);
vector<vector<pair<int,int>>>add(mxn);
vector<int>cnt(mxn);

int ans = 0;
queue<pair<int,int>>q;

void modify(int op, int freq){
	cnt[op]+=freq;
	while(tasks[op].size() && (*tasks[op].begin()).first <= cnt[op]){
		pair<int,int>p = *tasks[op].begin();
		tasks[op].erase(p);
		rem[p.second]--;
		if(rem[p.second] == 0){
			ans++;
			for(auto nxt: add[p.second]){
				q.push(nxt);
			}
		}
	}
}
signed main(){
	cin.tie(nullptr)->sync_with_stdio(false);
	int g;
	cin >> g;
	vector<pair<int,int>>arr(g);
	for(int i = 0; i<g; i++){
		int x,y;
		cin >> x >> y;
		arr[i] = {x,y};
	}
	int n;
	cin >> n;
	vector<vector<pair<int,int>>>rq(n+1);
	for(int i = 1; i<=n; i++){
		int m;
		cin >> m;
		for(int j = 0; j<m; j++){
			int x,y;
			cin >> x >> y;
			rq[i].push_back({x,y});
		}
		rem[i] = rq[i].size();
		int k;
		cin >> k;
		for(int j = 0; j<k; j++){
			int x,y;
			cin >> x >> y;
			add[i].push_back({x,y});
		}
	}
	vector<int>sorted;
	for(int i = 0; i<g; i++){
		sorted.push_back(arr[i].first);
	}
	for(int i = 1; i<=n; i++){
		for(auto [a,_] : rq[i]){
			sorted.push_back(a);
		}
		for(auto [a,_] : add[i]){
			sorted.push_back(a);
		}
	}
	sorted.push_back(-5);
	sort(sorted.begin(),sorted.end());
	for(int i = 0; i<g; i++){
		arr[i].first = lower_bound(sorted.begin(),sorted.end(),arr[i].first)-sorted.begin();
	}
	for(int i = 1; i<=n; i++){
		for(int j = 0; j<rq[i].size(); j++){
			rq[i][j].first = lower_bound(sorted.begin(),sorted.end(),rq[i][j].first)-sorted.begin();
			tasks[rq[i][j].first].insert({rq[i][j].second,i});
		}
		for(int j = 0; j<add[i].size(); j++){
			add[i][j].first = lower_bound(sorted.begin(),sorted.end(),add[i][j].first)-sorted.begin();
		}
		if(rem[i] == 0){
			for(auto nxt: add[i]){
				q.push(nxt);
				ans++;
			}
		}
	}
	for(int i = 0; i<g; i++){
		q.push(arr[i]);
	}
	while(q.size()){
		auto [op,freq] = q.front(); q.pop();
		modify(op,freq);
	}
	cout << ans << '\n';
	return 0;
}