#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define all(s) (s).begin(),(s).end()
#define vcin(n) for(ll i=0;i<ll(n.size());i++) cin>>n[i]
#define rever(vec) reverse(vec.begin(), vec.end())
#define sor(vec) sort(vec.begin(), vec.end())
#define fi first
#define se second
const ll mod = 998244353;
//const ll mod = 1000000007;
const ll inf = 2000000000000000000ll;
static const long double pi = 3.141592653589793;
template<class T,class U> void chmax(T& t,const U& u){if(t<u) t=u;}
template<class T,class U> void chmin(T& t,const U& u){if(t>u) t=u;}
ll modPow(ll a, ll n, ll mod) { ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }
int main() {
  /* mod は 1e9+7 */
  ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
  cout<< fixed << setprecision(10);
  ll n;
  cin>>n;
  assert(2<=n&&n<=100000);
  ll a[5][n-1];
  for(int i=0;i<5;i++){
    for(int j=0;j<n-1;j++){
      a[i][j]=0;
    }
  }
  ll f[5][n];
  map<ll,ll> w;
  map<ll,ll> ww;
  vector<ll> l(5),r(5);
  for(int i=0;i<5;i++){
    cin>>l[i]>>r[i];
    assert(1<=l[i]&&l[i]<r[i]&&r[i]<=n&&w[l[i]]==0&&ww[r[i]]==0);
    w[l[i]]++;
    ww[r[i]]++;
    l[i]--;
    r[i]--;
    for(int j=l[i];j<=r[i]-1;j++){
      cin>>a[i][j];
      assert(1<=a[i][j]&&a[i][j]<=100000);
      if(i!=0&&a[i-1][j]!=0){
        assert(a[i-1][j]<a[i][j]);
      }
      f[i][j]=0;
    }
    f[i][n-1]=0;
  }
  for(int i=0;i<5;i++){
    for(int j=1;j<n;j++){
      f[i][j]=f[i][j-1]+a[i][j-1];
    }
  }
  ll m;
  cin>>m;
  vector<vector<ll>> s(5);
  for(int i=0;i<m;i++){
    ll b,si;
    cin>>b>>si;
    assert(1<=b&&b<=5&&1<=si&&si<=1000000);
    b--;
    s[b].push_back(si);
  }
  for(int i=0;i<5;i++){
    sor(s[i]);
  }
  ll ans=0;
  for(int i=4;i>=0;i--){
    for(int j=i-1;j>=0;j--){
      if(l[i]>r[j]||l[j]>r[i]){
        continue;
      }
      if(l[i]<=l[j]&&r[j]<=r[i]){
        for(int k=0;k<int(s[j].size());k++){
          ll b=s[j][k];
          ll c=f[j][r[j]]-f[j][l[j]];
          ll d=f[i][r[j]]-f[i][l[j]];
     //     cout<<0<<" "<<i<<" "<<j<<" "<<b<<" "<<d<<" "<<c<<" "<<(upper_bound(all(s[i]),b)-s[i].begin())-(lower_bound(all(s[i]),b+c-d)-s[i].begin())<<endl;
          ans+=(upper_bound(all(s[i]),b-(f[i][l[j]]-f[i][l[i]]))-s[i].begin())-(lower_bound(all(s[i]),b+c-d-(f[i][l[j]]-f[i][l[i]]))-s[i].begin());
        }
      }
      else if(l[j]<=l[i]&&r[i]<=r[j]){
        for(int k=0;k<int(s[j].size());k++){
          ll b=s[j][k]+f[j][l[i]]-f[j][l[j]];
          ll c=f[j][r[i]]-f[j][l[i]];
          ll d=f[i][r[i]]-f[i][l[i]];
      //    cout<<1<<" "<<i<<" "<<j<<" "<<b<<" "<<d<<" "<<c<<" "<<(upper_bound(all(s[i]),b)-s[i].begin())-(lower_bound(all(s[i]),b+c-d)-s[i].begin())<<endl;
          ans+=(upper_bound(all(s[i]),b)-s[i].begin())-(lower_bound(all(s[i]),b+c-d)-s[i].begin());
        }
      }
      else if(l[i]<=l[j]){
        for(int k=0;k<int(s[j].size());k++){
          ll b=s[j][k];
          ll c=f[j][r[i]]-f[j][l[j]];
          ll d=f[i][r[i]]-f[i][l[j]];
      //    cout<<2<<" "<<i<<" "<<j<<" "<<b<<" "<<d<<" "<<c<<" "<<(upper_bound(all(s[i]),b)-s[i].begin())-(lower_bound(all(s[i]),b+c-d)-s[i].begin())<<endl;
          ans+=(upper_bound(all(s[i]),b-(f[i][l[j]]-f[i][l[i]]))-s[i].begin())-(lower_bound(all(s[i]),b+c-d-(f[i][l[j]]-f[i][l[i]]))-s[i].begin());
        }
      }
      else if(l[j]<=l[i]){
        for(int k=0;k<int(s[j].size());k++){
          ll b=s[j][k]+f[j][l[i]]-f[j][l[j]];
          ll c=f[j][r[j]]-f[j][l[i]];
          ll d=f[i][r[j]]-f[i][l[i]];
       //   cout<<3<<" "<<i<<" "<<j<<" "<<b<<" "<<d<<" "<<c<<" "<<(upper_bound(all(s[i]),b)-s[i].begin())-(lower_bound(all(s[i]),b+c-d)-s[i].begin())<<endl;
          ans+=(upper_bound(all(s[i]),b)-s[i].begin())-(lower_bound(all(s[i]),b+c-d)-s[i].begin());
        }
      }
    }
  }
  cout<<ans<<endl;
}