#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fup(a, b, c, d) for(int a = (b); a <= (c); a += (d))
#define fdo(a, b, c, d) for(int a = (b); a >= (c); a -= (d))
typedef long long ll;
typedef pair<int , int> PII;
typedef map<int , int> MII;
const int inf = 0x3f3f3f3f, N = 2e5 + 10, M = 4e5 + 10, mod = 1e9 + 7;
const ll INF = 0x3f3f3f3f3f3f3f3f;

int g, n;

int yq[N];
map<int , priority_queue<PII, vector<PII>, greater<PII>>> he;
vector<PII> v[N];
queue<int> q;
vector<PII> ch;
map<int , int> mp;

void add(int op, int nu)
{
    int &va = mp[op];
    va += nu;
    priority_queue<PII, vector<PII>, greater<PII>> &pq = he[op];

    while(!pq.empty()) {
        PII p = pq.top();
        if(p.first > va) break ;
        pq.pop();
        if((-- yq[op]) == 0) q.push(p.second);
    }
}

void solve()
{
    cin >> g;

    fup(i, 1, g, 1) {
        int a, b;
        cin >> a >> b;
        ch.push_back({a,b});
    }

    cin >> n;

    fup(i, 1, n, 1) {
        int m, k;
        cin >> m;
        yq[i] = m;
        fup(j, 1, m, 1) {
            int a, b;
            cin >> a >> b;
            he[a].push({b, i});
        }

        cin >> k;
        fup(j, 1, k, 1) {
            int c, d;
            cin >> c >> d;
            v[i].push_back({c, d});
        }
    }

    fup(i, 1, n, 1) {
        if(!yq[i]) {
            q.push(i);
        }
    }

    for(auto x : ch) {
        int op, nu;
        op = x.first, nu = x.second;
        add(op, nu);
    }

    int ans = 0;
    while(!q.empty()) {
        int id = q.front();
        q.pop();
        ans ++;

        for(auto x : v[id]) add(x.first, x.second);
    }

    cout << ans << '\n';
}

signed main()
{
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(false);

    int _ = 1;
    // cin >> _;
    while(_ --)
    {
        solve();
    }
}