#include <bits/stdc++.h>
using namespace std;

using i64 = long long;

int __OneWan_2024 = [](){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	return 0;
}();

map<int, i64> cnt;
map<int, vector<array<int, 2>>> mp;
int flag[100005];
int m[100005];
int k[100005];
vector<array<int, 2>> v[100005];
int main() {
    int g;
    cin >> g;
    for (int i = 1; i <= g; i++) {
        int x, y;
        cin >> x >> y;
        cnt[x] += y;
    }
    int n;
    cin >> n;
    for (int i = 1 ; i <= n ; i++) {
        cin >> m[i];
        flag[i] = 0;
        for (int j = 0 ; j < m[i] ; j++) {
            int x, y;
            cin >> x >> y;
            if (cnt.count(x) && cnt[x] >= y) {
                flag[i]++;
            } else {
                mp[x].push_back({y, i});
            }
        }
        cin >> k[i];
        for (int j = 0 ; j < k[i] ; j++) {
            int x, y;
            cin >> x >> y;
            v[i].push_back({x, y});
        }
    }
    for (auto &[_, vec] : mp) {
        sort(rbegin(vec), rbegin(vec));
    }
    queue<int> que;
    for (int i = 1 ; i <= n ; i++) {
        if (flag[i] == m[i]) {
            que.push(i);
        }
    }
    while (!que.empty()) {
        int x = que.front();
        que.pop();
        for (auto &[x, y] : v[x]) {
            i64 z = cnt[x] += y;
            auto &vec = mp[x];
            while (!vec.empty() && vec.back()[0] <= z) {
                int gs = vec.back()[1];
                flag[gs]++;
                if (flag[gs] == m[gs]) {
                    que.push(gs);
                }
                vec.pop_back();
            }
        }
    }
    int ans = 0;
    for (int i = 1 ; i <= n ; i++) {
        if (flag[i] == m[i]) {
            ans++;
        }
    }
    cout << ans << "\n";
	return 0;
}