#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define ALL(x) (x).begin(), (x).end()
void solve()
{
    int g;
    cin >> g;
    vector<pair<int, int>> arr(g);
    vector<int> lisan;
    lisan.reserve(g);
    for (auto &i : arr)
    {
        cin >> i.first >> i.second;
        lisan.push_back(i.first);
    }
    int n;
    cin >> n;
    vector<vector<pair<int, int>>> task(n); // ren renshu
    vector<vector<pair<int, int>>> get(n);
    for (int i = 0; i < n; i++)
    {
        int m;
        cin >> m;
        for (int j = 0; j < m; j++)
        {
            int a, b;
            cin >> a >> b;
            task[i].push_back({a, b});
            lisan.push_back(a);
        }
        cin >> m;
        for (int j = 0; j < m; j++)
        {
            int a, b;
            cin >> a >> b;
            get[i].push_back({a, b});
            lisan.push_back(a);
        }
    }
    sort(lisan.begin(), lisan.end());
    lisan.erase(unique(lisan.begin(), lisan.end()), lisan.end());
    vector<ll> cnt(lisan.size());
    vector<int> wait(n);
    for (auto [i, j] : arr)
    {
        int d = lower_bound(lisan.begin(), lisan.end(), i) - lisan.begin();
        cnt[d] += j;
    }
    vector<priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>> que(lisan.size());
    int ans = 0;
    vector<int> vis(lisan.size());
    for (int i = 0; i < n; i++)
    {
        for (auto [x, y] : task[i])
        {
            x = lower_bound(lisan.begin(), lisan.end(), x) - lisan.begin();
            if (cnt[x] < y)
            {
                que[x].push({y, i});
                wait[i]++;
            }
        }
        stack<int> sta;
        if (wait[i] == 0)
            sta.push(i);
        vis[i] = 1;
        while (sta.size())
        {
            int d = sta.top();
            ans++;
            sta.pop();
            vis[d] = 0;
            for (auto [x, y] : get[d])
            {
                x = lower_bound(lisan.begin(), lisan.end(), x) - lisan.begin();
                cnt[x] += y;
                while (que[x].size() && que[x].top().first <= cnt[x])
                {
                    wait[que[x].top().second]--;
                    if (wait[que[x].top().second] == 0)
                    {
                        sta.push(que[x].top().second);
                    }
                    que[x].pop();
                }
            }
        }
    }
    cout << ans << endl;
}
int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
    }
}