#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
struct node{
    ll a, b;
    node(ll a = 0, ll b = 0) : a(a), b(b) {}
    bool operator < (const node &x) const {
        return b > x.b;
    }
};
unordered_map<ll, ll> mp;
unordered_map<ll, priority_queue<node>> qa;
struct bonus{
    int n;
    vector<ll> a, b;
    bonus(int n = 0) : n(n) {
        a.resize(n + 1);
        b.resize(n + 1);
    }
    void read()
    {
        cin >> n;
        a.resize(n + 1);
        b.resize(n + 1);
        for(int i = 1; i <= n; i++)
        {
            cin >> a[i] >> b[i];
        }
    }
};
void solve()
{
    int n, m;
    cin >> m;
    queue<pair<ll, ll>> q;
    for(int i = 1; i <= m; i++)
    {
        ll x, y;
        cin >> x >> y;
        q.push({x, y});
    }
    cin >> n;
    int ans = 0;
    vector<int> d(n + 1);
    vector<bonus> B(n + 1);
    for(int i = 1; i <= n; i++)
    {
        cin >> d[i];
        for(int j = 1; j <= d[i]; j++)
        {
            ll x, y;
            cin >> x >> y;
            qa[x].push({i, y});
        }
        B[i].read();
        if(d[i] == 0)
        {
            ans++;
            for(int j = 1; j <= B[i].n; i++)
            {
                q.push({B[i].a[j], B[i].b[j]});
            }
        }
    }
    while(!q.empty())
    {
        auto [x, y] = q.front();
        q.pop();
        mp[x] += y;
        while(!qa[x].empty() && qa[x].top().b <= mp[x])
        {
            auto [a, b] = qa[x].top();
            qa[x].pop();
            d[a]--;
            if(!d[a])
            {
                ans++;
                for(int i = 1; i <= B[a].n; i++)
                {
                    q.push({B[a].a[i], B[a].b[i]});
                }
            }
        }
    }
    cout << ans << "\n";
}
int main()
{
    cin.tie(0)->sync_with_stdio(false);
    solve();
    return 0;
}