#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 1009;
map<int,int> val, ned[N];
vector<pair<int,int>> cst[N];
map<int, priority_queue<pair<int,int>>> q;
queue<int> Q;
int n, g, m[N], k[N];
void work() {
    cin >> g;
    for(int i = 1; i <= g; i ++) {
        int x, y;
        cin >> x >> y;
        val[x] = y;
    }
    cin >> n;
    auto add = [&](int id) {
        for(auto [x, y] : cst[id]) {
            val[x] += y;
            while(!q[x].empty() && q[x].top().first + val[x] >= 0) {
                ned[q[x].top().second].erase(x);
                if(ned[q[x].top().second].size() == 0) Q.push(q[x].top().second);
                q[x].pop();
            }
        }
    };
    for(int i = 1; i <= n; i ++) {
        cin >> m[i];
       // cout << i << endl;
        for(int j = 1; j <= m[i]; j ++) {
            int x, y;
            cin >> x >> y;
            if(val.count(x) && val[x] >= y) continue;
            ned[i][x] = y;
            //cout << x << " " <<y << endl;
            q[x].push({-y, i});
        }
      //  cout << endl;
        cin >> k[i];
        for(int j = 1; j <= k[i]; j ++) {
            int x, y;
            cin >> x >> y;
            cst[i].push_back({x, y});
        }
        if(ned[i].size() == 0) Q.push(i);
    }
  //  cout << "!!!!!!" << endl;
    int num = 0;
    while(!Q.empty()) {
        int x = Q.front(); Q.pop();
        add(x);
       // cout << x << endl;
        num ++;
    }
    cout << num << endl;
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int Case = 1;
    //cin >> Case;
    while(Case --) work();
    return 0;
}