#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),(k))-v.begin())
#define ub(v,k) (upper_bound(all(v),(k))-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=998244353;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
inline ll readll() {
    ll x = 0;
    char ch = getchar_unlocked();
    while (ch < '0' || ch > '9') ch = getchar_unlocked();
    while (ch >= '0' && ch <= '9'){
		x = (x << 3) + (x << 1) + ch - '0';
		ch = getchar_unlocked();
	}
    return x;
}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}
int main(){
    ll n;cin>>n;
    assert(2<=n&&n<=100000);
    vvi v(5,vi(n-1));
    vp range(5);
    rep(i,5){
        cin>>range[i].fi>>range[i].se;
        assert(1<=range[i].fi&&range[i].fi<range[i].se&&range[i].se<=n);
        range[i].fi--;range[i].se--;
        REP(j,range[i].fi,range[i].se){
            cin>>v[i][j];
            assert(1<=v[i][j]&&v[i][j]<=100000);
        }
    }
    rep(a,5)REP(b,a+1,5)rep(j,n-1)if(v[a][j]&&v[b][j])assert(v[a][j]<v[b][j]);
    vvi rui(5,vi(n));
    rep(i,5)rep(j,n-1)rui[i][j+1]=rui[i][j]+v[i][j];
    auto len=[&](ll num,ll a,ll b){
        return rui[num][b]-rui[num][a];
    };
    ll m;cin>>m;
    assert(1<=m&&m<=100000);
    vvi train(5);
    vb check(1000001,false);
    rep(i,m){
        ll b,s;cin>>b>>s;
        assert(1<=b&&b<=5);assert(1<=s&&s<=1000000);
        assert(!check[s]);
        check[s]=true;
        train[b-1].pb(s);
    }
    rep(i,5)sort(all(train[i]));
    ll ans=0;
    rep(a,5)REP(b,a+1,5){
        assert(range[a].fi!=range[b].fi);
        assert(range[a].se!=range[b].se);
        ll mi=max(range[a].fi,range[b].fi),ma=min(range[a].se,range[b].se);
        if(mi>ma)continue;
        ll ta=len(a,range[a].fi,mi),tb=len(b,range[b].fi,mi);
        ll A=len(a,mi,ma),B=len(b,mi,ma);
        vi l(train[b].size()),r(train[b].size());
        ll c=0;
        rep(i,train[b].size()){
            while(c<train[a].size()&&train[a][c]<train[b][i]+tb-ta)c++;
            l[i]=c;
        }
        c=0;
        rep(i,train[b].size()){
            while(c<train[a].size()&&train[a][c]<=train[b][i]+tb-ta+B-A)c++;
            r[i]=c;
        }
        rep(i,train[b].size())ans+=r[i]-l[i];
    }
    out(ans);
}