#include <bits/stdc++.h>
#define endl '\n'
#define pii pair<i64, i64>
#define mp make_pair
using namespace std;
using i64 = unsigned long long;

void solve()
{
    int g;
    cin >> g;

    map<i64, i64> staff;
    for (int i = 1; i <= g; i++)
    {
        i64 t, u;
        cin >> t >> u;
        staff[t] = u;
    }

    int n;
    cin >> n;
    map<i64, i64> qry;
    map<i64, set<pii>> need, gain;
    map<i64, priority_queue<pii, vector<pii>, greater<pii>>> q;
    for (int i = 1; i <= n; i++)
    {
        int m;
        cin >> m;
        while (m--)
        {
            i64 a, b;
            cin >> a >> b;
            need[i].insert(mp(a, b));
            q[a].emplace(b, i);
        }

        int k;
        cin >> k;
        while (k--)
        {
            i64 c, d;
            cin >> c >> d;
            gain[i].insert(mp(c, d));
        }
    }

    vector<bool> vis(n+1);
    queue<int> que;

    for (int i = 1; i <= n; i++)
    {
        for (auto [a, b] : need[i])
        {
            if (staff[a] >= b)
                qry[i]++;
        }
        if (qry[i] == need[i].size())
            que.push(i);
    }

    // cout << "OK input\n";

    // while(que.size()){
    //     cout<<que.front()<<endl;
    //     que.pop();
    // }

    int ans = 0;
    while (que.size())
    {
        ans++;

        int u = que.front();
        que.pop();

        if(vis[u])
            continue;
        vis[u]=true;

        for (auto [c, d] : gain[u])
        {
            staff[c] += d;
            while (q[c].size() && staff[c] >= q[c].top().first)
            {
                auto [a, b] = q[c].top();
                q[c].pop();
                qry[b]++;
                if (qry[b] == need[b].size())
                    que.push(b);
            }
        }
    }

    cout << ans;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);

    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    return 0;
}