#include<bits/stdc++.h>
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 node
{
	int x, y;
	bool operator < (const node& a) const //重载
	{
		return x > a.x; //x小的优先级高
	}
};
//priority_queue<node>s;
map<ll, ll>s,h;
map<ll, priority_queue<node>>d;
map<ll, map<ll, ll>>f;
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	ll n, m, p, sh;
	m = read();
	for (int i = 1; i <= m; i++)
	{
		p = read(), sh = read();
		h[p] = sh;
	}
	n = read();
	for (int u = 1; u <= n; u++)
	{
		m = read();
		for (int i = 1; i <= m; i++)
		{
			p = read(), sh = read();
			node op = { sh,u };
			d[p].push(op);
		}
		m = read();
		s[u] = m;
		for (int i = 1; i <= m; i++)
		{
			p = read(), sh = read();
			f[u][p] = sh;
		}
	}
	ll g = 0, k = 0;
	while (1)
	{
		g = 0;
		for (auto i : h)
		{
			ll op = i.first;
			while (!d[op].empty() && d[op].top().x <= h[op])
			{
				s[d[op].top().y]--;
				if (s[d[op].top().y] == 0)
				{
					k++;
					g++;
					for (auto y : f[d[op].top().y])
					{
						h[d[op].top().y] += f[d[op].top().y][d[op].top().x];
					}
				}
				d[op].pop();
			}
		}
		if (g == 0 || k == n)break;
	}
	cout << k+2;
	return 0;
}