#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>

#include<queue>
#include<unordered_map>
using namespace std;
const int N = 300000;

int t[N + 5], u[N + 5], m[N + 5], k[N + 5];
vector<long long> c[N + 5], d[N + 5];
unordered_map<int, long long> cnt;
queue<int> Q;
unordered_map<int, priority_queue<pair<long long, int> > > X;

int main()
{
    int g, num = 0;
    scanf("%d", &g);
    for (int i = 1; i <= g; i++) {
        scanf("%d %d", &t[i], &u[i]);
    }
    int n;
    scanf("%d", &n);
    for (int i = 1; i <= n; i++)
    {
        scanf("%d", &m[i]);
        for (int j = 1; j <= m[i]; j++) {
            int aa, bb;
            scanf("%d %d", &aa, &bb);
            X[aa].push(make_pair(-bb, i));
        }
        scanf("%d", &k[i]);
        c[i].push_back(0);
        d[i].push_back(0);
        for (int j = 1; j <= k[i]; j++) {
            int cc, dd;
            scanf("%d %d", &cc, &dd);
            c[i].push_back(cc);
            d[i].push_back(dd);
        }
    }
    
    int ans = 0;
    for (int i = 1; i <= n; i++)
        if (m[i] <= 0) ans++, Q.push(i);
    for (int i = 1; i <= g; i++) 
    {
        long long &val = cnt[t[i]];
        val += u[i];
        priority_queue<pair<long long, int> > &heap = X[t[i]];
        while (-heap.top().first <= val)
        {
            pair<long long, int> cur = heap.top();
            m[cur.second]--;
            if (m[cur.second] <= 0) {
                ans++;
                Q.push(i);
            }
            heap.pop();
        }
    }
    // printf("after\n");
    // printf("%d\n", ans);
    
    while (!Q.empty())
    {
        int i = Q.front();
        Q.pop();
        // printf("pop %d\n", i);
        for (int j = 1; j <= k[i]; j++)
        {
            long long &val = cnt[c[i][j]];
            val += d[i][j];
            priority_queue<pair<long long, int> > &heap = X[c[i][j]];
            // if (val <= 10) printf("ffff%d %d %d %d \n", j, c[i][j], val, heap.size());
            while (!heap.empty() && -heap.top().first <= val)
            {
                int nxt = heap.top().second;
                // if (m[nxt] >= 0) {
                //     printf("unlimit %d %d\n", nxt, m[nxt]);
                    // printf("%d %d %d\n", X[c[i][j]].top().first, X[c[i][j]].top().second, X[c[i][j]].size());
                // }
                m[nxt]--;
                if (m[nxt] <= 0) {
                    ans++;
                    Q.push(nxt);
                }
                heap.pop();
                // if (limit[nxt] >= 0) {
                //     printf("%d %d %d\n", X[c[i][j]].top().first, X[c[i][j]].top().second, X[c[i][j]].size());
                // }
            }
        }
    }
    printf("%d\n", ans);
    return 0;
}