#include <bits/stdc++.h>
using namespace std;
int main(){
  int N;
  cin >> N;
  vector<int> L(5), R(5);
  vector<vector<int>> A(5, vector<int>(N - 1, 0));
  for (int i = 0; i < 5; i++){
    cin >> L[i] >> R[i];
    L[i]--;
    R[i]--;
    for (int j = L[i]; j < R[i]; j++){
      cin >> A[i][j];
    }
  }
  int M;
  cin >> M;
  assert(M <= 10000);
  vector<int> B(M), S(M);
  for (int i = 0; i < M; i++){
    cin >> B[i] >> S[i];
    B[i]--;
  }
  vector<vector<long long>> T(5, vector<long long>(N));
  for (int i = 0; i < 5; i++){
    T[i][0] = 0;
    for (int j = 0; j < N - 1; j++){
      T[i][j + 1] = T[i][j] + A[i][j];
    }
  }
  long long ans = 0;
  for (int i = 0; i < M; i++){
    for (int j = i + 1; j < M; j++){
      int l = max(L[B[i]], L[B[j]]);
      int r = min(R[B[i]], R[B[j]]);
      if (l < r){
        long long tli = S[i] + (T[B[i]][l] - T[B[i]][L[B[i]]]);
        long long tlj = S[j] + (T[B[j]][l] - T[B[j]][L[B[j]]]);
        long long tri = S[i] + (T[B[i]][r] - T[B[i]][L[B[i]]]);
        long long trj = S[j] + (T[B[j]][r] - T[B[j]][L[B[j]]]);
        if (tli <= tlj && tri >= trj || tli >= tlj && tri <= trj){
          ans++;
        }
      }
    }
  }
  cout << ans << endl;
}