#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<pair<int, int> > c[N + 5];
unordered_map<int, long long> cnt;
queue<int> Q;
unordered_map<int, priority_queue<pair<int, 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]);
        for (int j = 1; j <= k[i]; j++) {
            int cc, dd;
            scanf("%d %d", &cc, &dd);
            c[i].push_back(make_pair(cc, dd));
        }
    }
    
    int ans = 0;
    for (int i = 1; i <= n; i++)
        if (m[i] <= 0) Q.push(i);
    for (int i = 1; i <= g; i++) 
    {
        long long &val = cnt[t[i]];
        val += u[i];
        priority_queue<pair<int, int> > &heap = X[t[i]];
        while (-heap.top().first <= val)
        {
            int cur = heap.top().second;
            if ((--m[cur]) <= 0) Q.push(cur);
            heap.pop();
        }
    }
    
    while (!Q.empty())
    {
        int i = Q.front();
        Q.pop();
        ans++;
        for (pair<int, int> j : c[i])
        {
            long long &val = cnt[j.first];
            val += j.second;
            priority_queue<pair<int, int> > &heap = X[j.first];
            while (!heap.empty() && -heap.top().first <= val)
            {
                int nxt = heap.top().second;
                if ((--m[nxt]) <= 0) Q.push(nxt);
                heap.pop();
            }
        }
    }
    printf("%d\n", ans);
    return 0;
}