#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

struct io_setup{
    io_setup(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

int main(){
    int N;
    cin >> N;
    vector<int> L(5), R(5);
    vector<vector<ll>> D(5);
    rep(i, 5){
        cin >> L[i] >> R[i];
        D[i].resize(R[i]-L[i]);
        rep(j, R[i]-L[i]) cin >> D[i][j];
    }

    vector<vector<ll>> A(5, vector<ll>(5, -INF)), B(5, vector<ll>(5, -INF));
    rep(i, 5){
        rep(j, 5){
            if(j < i) continue;
            if(L[i] >= L[j]){
                if(R[j] < L[i]) continue;
                A[i][j] = 0;
                rep(k, L[i]-L[j]) A[i][j] += D[j][k];
                ll tmp = 0;
                rep(k, min(R[i], R[j])-L[i]){
                    tmp += D[j][L[i]-L[j]+k], tmp -= D[i][k];
                }
                B[i][j] = A[i][j]+tmp;
            }
            else{
                if(R[i] < L[j]) continue;
                A[i][j] = 0;
                rep(k, L[j]-L[i]) A[i][j] -= D[i][k];
                ll tmp = 0;
                rep(k, min(R[i], R[j])-L[j]){
                    tmp += D[j][k], tmp -= D[i][L[j]-L[i]+k];
                }
                B[i][j] = A[i][j]+tmp;
            }
        }
    }

    int M;
    cin >> M;
    vector<vector<ll>> ts(5);
    rep(i, M){
        ll q, s;
        cin >> q >> s;
        q--;
        ts[q].eb(s);
    }
    rep(i, 5) sort(all(ts[i]));

    ll ans = 0;
    rep(j, 5){
        rep(i, j){
            each(e, ts[j]){
                ans += upper_bound(all(ts[i]), e+B[i][j])-lower_bound(all(ts[i]), e+A[i][j]);
            }
        }
    }
    cout << ans << '\n';
}