/* -*- coding: utf-8 -*-
 *
 * 1347.cc:  No.1347 HS Railway - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int K = 5;
const int MAX_N = 100000;
const int MAX_M = 100000;

/* typedef */

typedef long long ll;
typedef vector<ll> vl;

/* global variables */

int ls[K], rs[K];
ll ass[K][MAX_N + 1];
vl sts[K];

/* subroutines */

/* main */

int main() {
  int n;
  scanf("%d", &n);

  for (int i = 0; i < K; i++) {
    scanf("%d%d", ls + i, rs + i);
    ls[i]--, rs[i]--;
    for (int j = ls[i]; j < rs[i]; j++) {
      int a;
      scanf("%d", &a);
      ass[i][j + 1] = ass[i][j] + a;
    }
  }

  int m;
  scanf("%d", &m);

  for (int i = 0; i < m; i++) {
    int bi, si;
    scanf("%d%d", &bi, &si);
    bi--;
    sts[bi].push_back(si);
  }

  for (int i = 0; i < K; i++) {
    sort(sts[i].begin(), sts[i].end());
    //for (int j = 0; j < sts[i].size(); j++) printf("%lld ", sts[i][j]);
    //putchar('\n');
  }

  ll cnt = 0;
  for (int i = 0; i < K; i++)
    for (int j = i + 1; j < K; j++) {
      vl &sti = sts[i], &stj = sts[j];
      if (sti.empty() || stj.empty()) continue;

      int l = max(ls[i], ls[j]), r = min(rs[i], rs[j]);
      if (l >= r) continue;

      ll d0 = ass[j][l] - ass[i][l];
      ll d1 = ass[j][r] - ass[i][r];
      //printf("%d,%d: %d-%d, %lld,%lld\n", i, j, l, r, d0, d1);

      for (vl::iterator vit = stj.begin(); vit != stj.end(); vit++) {
	int x0 = lower_bound(sti.begin(), sti.end(), *vit + d0) - sti.begin();
	int x1 = upper_bound(sti.begin(), sti.end(), *vit + d1) - sti.begin();
	cnt += x1 - x0;
      }
    }

  printf("%lld\n", cnt);
  return 0;
}