#include<cstdio>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<string.h>
#include<iomanip>
#include<stack>
#include<deque>
#include<queue>
#include<vector>
#include<map>
using namespace std;
typedef long long ll;
inline int read() {
	register int s = 0, w = 1;
	char ch = getchar();
	while (ch < '0' || ch > '9') {
		if (ch == '-')
			w = -1;
		ch = getchar();
	}
	while (ch >= '0' && ch <= '9')
		s = s * 10 + ch - '0', ch = getchar();
	return s * w;
}
struct jh
{
	map<ll, ll>d, f;
}l[100005];
ll n, g, nu;
map<ll, ll>h,kl;
int cmp(jh a, jh b)
{
	for (auto i : kl)
	{
		ll p = i.first;
		if ((!a.d.count(p) && b.d.count(p)) || (a.d.count(p) && b.d.count(p) && a.d[p] < b.d[p]))
		{
			return 1;
		}
		else if ((a.d.count(p) && !b.d.count(p)) || (a.d.count(p) && b.d.count(p) && a.d[p] > b.d[p]))
			return 0;
	}
	return 1;
}
//vector<map<ll, ll>>d[100005];
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	nu = read();
	ll p, sh;
	for (int i = 1; i <= nu; i++)
	{
		p = read(), sh = read();
		h[p] = sh;
	}
	n = read();
	for (int i = 1; i <= n; i++)
	{
		nu = read();
		for (int y = 1; y <= nu; y++)
		{
			p = read(), sh = read();
			l[i].d[p] = sh;
			kl[p]++;
		}
		nu = read();
		for (int y = 1; y <= nu; y++)
		{
			p = read(), sh = read();
			l[i].f[p] = sh;
		}
	}
	sort(l + 1, l + n + 1, cmp);
	g = 0; ll k = 0;
	map<ll, ll>hf;
	//for (int i = 1; i <= n; i++)
	//{
	//	cout << l[i].d.size() << " ";
	//	for(auto y:l[i].d)
	//	cout <<y.first<<" " << y.second << " ";
	//	cout << '\n';
	//}
	while (1)
	{
		map<ll, ll>pl;
		ll bee=0, enn=n;
		//cout << h.size() <<" ";
		//for (auto i : h)
		//{
		//	cout << i.first << " " << i.second << " ";
		//}
		//cout << '\n';
		for (auto i : h)
		{
			ll be = bee, en = enn, mid,op=i.first;
			while (en > be)
			{
				mid = (be + en+1) / 2;
				//cout << l[mid].d[op] << "      ";
				if (!l[mid].d.count(op) || l[mid].d[op] <= h[op])be = mid;
				else en = mid-1;
			}
			enn = be;
			if (enn == 0)
			{
				enn = -1; break;
			}
			if (bee > enn)
			{
				break;
			}
			for (int y = 1; y <= enn; y++)
			{
				if(l[y].d.count(op))
				pl[y]++;
			}
		}
		//for (auto i : hf)cout << i.first << " ";
		//cout << '\n';
		if (k == n || enn <=bee)
		{
			break;
		}
		int opp = 0;
		for (int i = 1; i <= enn; i++)
		{
			if (!hf.count(i)&&pl[i]==l[i].d.size())
			{
				hf[i]++;
				for (auto y : l[i].f)
				{
					h[y.first] += y.second;
				}
				k++;
				opp++;
			}
		}
		if (opp == 0)break;
		enn = n;
	}
	printf("%lld", k);
	return 0;
}