#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  constexpr int N = 5;
  int n; cin >> n;
  vector<int> l(N), r(N);
  vector<vector<int>> a(N);
  vector<vector<ll>> c(N);
  REP(i, N) {
    cin >> l[i] >> r[i]; --l[i]; --r[i];
    a[i].resize(r[i] - l[i]);
    REP(j, r[i] - l[i]) cin >> a[i][j];
    c[i].resize(r[i] - l[i] + 1);
    REP(j, r[i] - l[i]) c[i][j + 1] = c[i][j] + a[i][j];
  }
  int m; cin >> m;
  vector<int> bs(m), ss(m); REP(i, m) cin >> bs[i] >> ss[i], --bs[i];
  vector<int> ord(m);
  iota(ALL(ord), 0);
  sort(ALL(ord), [&](int x, int y) { return ss[x] < ss[y]; });
  vector<vector<int>> train(N);
  ll ans = 0;
  auto f = [&](int i, ll lb, ll ub) {
    if (lb <= ub) ans += upper_bound(ALL(train[i]), ub) - lower_bound(ALL(train[i]), lb);
  };
  REP(_, m) {
    int b = bs[ord[_]], s = ss[ord[_]];
    REP(i, N) {
      if (l[i] < l[b]) {
        if (l[b] < r[i]) {
          int dst = min(r[i], r[b]);
          if (i < b) {
            f(i, s - c[i][l[b] - l[i]], s + c[b][dst - l[b]] - c[i][dst - l[i]]);
          } else {
            f(i, s + c[b][dst - l[b]] - c[i][dst - l[i]], s - c[i][l[b] - l[i]]);
          }
        }
      } else if (l[i] > l[b]) {
        if (l[i] < r[b] && i > b) {
          int dst = min(r[i], r[b]);
          f(i, s + c[b][dst - l[b]] - c[i][dst - l[i]], s);
        }
      }
    }
    train[b].emplace_back(s);
  }
  cout << ans << '\n';
  return 0;
}