#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define sz(a) ((int)a.size())
#define all(a) a.begin(), a.end()
#define rep(i, l, r) for (int i = l; i < r; ++i)
#define per(i, r, l) for (int i = r-1; i >= l; --i)
typedef long long ll;
typedef pair<int, int> PI;
template<typename T> bool setmax(T &a, T b) { return (a < b ? a = b, 1 : 0); }
template<typename T> bool setmin(T &a, T b) { return (a > b ? a = b, 1 : 0); }

#define print(a) cerr << "[ "; for (auto it : a) cerr << it << ", "; cerr << "]\n";

int main() {
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    int g; cin >> g;
    map<int, int> has;
    for (int i = 0; i < g; i++) {
        int t, u; cin >> t >> u;
        has[t] = u;
    }
    int n; cin >> n;
    map<int, int> need;
    map<int, multiset<PI>> todo;
    vector<vector<PI>> bonus(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;
            if (has[a] >= b) continue;
            ++need[i];
            todo[a].insert(mp(b, i));
        }
        int k; cin >> k;
        for (int j = 0; j < k; j++) {
            int c, d; cin >> c >> d;
            bonus[i].push_back(mp(c, d));
        }
        if (!need[i]) {
            // finish
            auto get = [&](auto get, int x) -> void {
                vector<int> finish;
                for (auto [c, d] : bonus[x]) {
                    has[c] += d;
                    int cnt = 0;
                    for (auto [more, id] : todo[c]) {
                        if (more > has[c]) break;
                        ++cnt;
                        --need[id];
                        if (!need[id]) {
                            // get(get, id);
                            finish.push_back(id);
                        }
                    }
                    while (cnt--) todo[c].erase(todo[c].begin());
                    // cerr << "??? " << x << ' ';
                    // print(finish);
                }
                assert(sz(finish) == sz(set<int>(all(finish))));
                for (int id : finish) get(get, id);
            };
            get(get, i);
        }
    }
    int ans = 0;
    for (int i = 0; i < n; i++) ans += !need[i];
    cout << ans << '\n';

    return 0;
}