#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e6 + 7;
const int mod9 = 998244353;
const int mod1 = 1e9 + 7;
#define int ll
map<int, priority_queue<pair<int, int>, vector<pair<int, int>>, greater<>>> mp; // 这种工人， 所有需要这个项目该工种人数的小根堆
int ne[N];
vector<pair<int, int>> kk[N];
map<int, int> has;
int n, g;
queue<int> q;
int ans = 0;
void doo()
{
    while (q.size())
    {
        auto i = q.front();
        q.pop();
        ans++;
        for (int j = 0; j < (int)kk[i].size(); j++)
        {
            auto [c, d] = kk[i][j];
            has[c] += d;
            while (mp[c].size() && mp[c].top().first <= has[c])
            {
                auto [a, b] = mp[c].top();
                mp[c].pop();
                ne[a]--;
                if (ne[a] == 0)
                    q.push(b);
            }
        }
    }
}
void solve()
{
    cin >> g;
    for (int i = 1; i <= g; i++)
    {
        int t, h;
        cin >> t >> h;
        has[t] = h;
    }
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        int m;
        cin >> m;
        ne[i] = m;
        for (int j = 1; j <= m; j++)
        {
            int a, b;
            cin >> a >> b;
            if (has[a] >= b)
                ne[i]--;
            else
                mp[a].push({b, i});
        }
        if (ne[i] == 0)
            q.push(i);
        int k;
        cin >> k;
        for (int j = 1; j <= k; j++)
        {
            int c, d;
            cin >> c >> d;
            kk[i].push_back({c, d});
        }
    }
    doo();
    cout << ans << '\n';
}
signed main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int _ = 1;
    // cin >> _;
    while (_--)
        solve();
    return 0;
}