#include <bits/stdc++.h>
// #include <bits/extc++.h>
// using namespace __gnu_pbds;
// gp_hash_table<int, bool> hs;
#define bit1(x) __builtin_popcount(x)
#define all(x) (x).begin(), (x).end()
#define lowbit(i) ((i) & -(i))
#define ull unsigned long long
#define int long long
// #define ll long long
#define Genshin return
#define Impact 0
#define endl '\n'
using namespace std;
const int mod = 998244353;
const int N = 2e5 + 10;
int ksm(int base, int n)
{
    int res = 1;
    while (n > 0)
    {
        if (n & 1)
            res = (res * base) % mod;
        base = (base * base) % mod;
        n >>= 1;
    }
    return res;
}
int g, n;
map<int, int> m;
map<int, int> mp[100010];
// vector<pair<int,int>>
map<int, deque<pair<int, int>>> b;
int k[100010];
int kk[100010];

void solve()
{
    cin >> g;
    for (int i = 0; i < g; i++)
    {
        int aa, bb;
        cin >> aa >> bb;
        m[aa] += bb;
    }
    cin >> n;
    queue<int> q;
    for (int i = 1; i <= n; i++)
    {
        cin >> k[i];
        int aa, bb;
        for (int j = 0; j < k[i]; j++)
        {
            cin >> aa >> bb;
            b[aa].push_back({bb, i});
        }
        cin >> kk[i];
        for (int j = 0; j < kk[i]; j++)
        {
            cin >> aa >> bb;
            mp[i][aa] = bb;
        }
        if (k[i] == 0)
            q.push(i);
    }
    for (auto &[_, i] : b)
    {
        sort(all(i));
    }
    for (auto [x, y] : m)
    {
        if (b.find(x) != b.end())
        {
            while (!b[x].empty())
            {
                if (b[x].front().first > y)
                    break;
                k[b[x].front().second]--;
                if (k[b[x].front().second] == 0)
                {
                    q.push(b[x].front().second);
                }
                b[x].pop_front();
            }
        }
    }
    int ans = 0;
    while (!q.empty())
    {
        ans++;
        int i = q.front();
        q.pop();
        for (auto [x, y] : mp[i])
        {
            m[x] += y;
            y = m[x];
            if (b.find(x) != b.end())
            {
                while (!b[x].empty())
                {
                    if (b[x].front().first > y)
                        break;
                    k[b[x].front().second]--;
                    if (k[b[x].front().second] == 0)
                    {
                        q.push(b[x].front().second);
                    }
                    b[x].pop_front();
                }
            }
        }
    }
    cout << ans << endl;
    return;
}
signed main()
{
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int tt = 1;
    // cin >> tt;
    while (tt--)
    {
        solve();
    }
    Genshin Impact;
}