#include <bits/stdc++.h>
using namespace std;

template <class T> struct FenwickTree {
  const int n;
  vector<T> t;
  FenwickTree(int _n) : n(_n), t(n + 1) {}
  void add(int i, T x) { for (++i; i <= n; i += i & -i) t[i] ^= x; }
  T sum(int i) const {
    T s = 0;
    for (; i; i -= i & -i) s ^= t[i];
    return s;
  }
};

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  int n;
  cin >> n;
  vector<long long> h(n);
  for (auto&& e : h) {
    cin >> e;
  }
  struct Event {
    bool add;
    int c, l, r;
  };
  vector< vector<Event> > es(2 * n);
  for (int i = 0; i < n; ++i) {
    int a, b, c, d, e;
    cin >> a >> b >> c >> d >> e;
    --e;
    es[a].emplace_back(Event{true, e, b, d});
    es[c].emplace_back(Event{false, e, b, d});
  }
  int q;
  cin >> q;
  struct Query {
    int id, i;
  };
  vector< vector<Query> > qs(2 * n);
  for (int i = 0; i < q; ++i) {
    int x, y;
    cin >> x >> y;
    qs[x].emplace_back(Query{i, y});
  }
  vector<long long> res(q);
  FenwickTree<long long> ft(2 * n);
  vector< set<int> > lr(n), ls(n), rs(n);
  for (int t = 0; t < 2 * n; ++t) {
    for (auto e : es[t]) {
      if (e.add) {
        {
          auto it = lr[e.c].lower_bound(e.l);
          if (it != begin(lr[e.c]) and ls[e.c].count(*--it)) {
            e.l = *it;
          }
        }
        {
          auto it = lr[e.c].upper_bound(e.r);
          if (it != end(lr[e.c]) and rs[e.c].count(*it)) {
            e.r = *it;
          }
        }
        lr[e.c].erase(lr[e.c].lower_bound(e.l), lr[e.c].lower_bound(e.r + 1));
        ls[e.c].erase(ls[e.c].lower_bound(e.l), ls[e.c].lower_bound(e.r + 1));
        rs[e.c].erase(rs[e.c].lower_bound(e.l), rs[e.c].lower_bound(e.r + 1));
      } else {
        {
          auto it = lr[e.c].lower_bound(e.l);
          if (it != end(lr[e.c]) and *it == e.l) {
            assert(ls[e.c].count(e.l));
            lr[e.c].erase(e.l);
            ls[e.c].erase(e.l);
          } else if (it != begin(lr[e.c]) and ls[e.c].count(*--it)) {
            lr[e.c].insert(e.l);
            rs[e.c].insert(e.l);
          }
        }
        {
          auto it = lr[e.c].upper_bound(e.r);
          if (it != begin(lr[e.c]) and *--it == e.r) {
            assert(rs[e.c].count(e.r));
            lr[e.c].erase(e.r);
            rs[e.c].erase(e.r);
          } else if (it != end(lr[e.c]) and rs[e.c].count(*it)) {
            lr[e.c].insert(e.r);
            ls[e.c].insert(e.r);
          }
        }
      }
      ft.add(e.l, h[e.c]);
      ft.add(e.r, h[e.c]);
    }
    for (auto e : qs[t]) {
      res[e.id] = ft.sum(e.i + 1);
    }
  }
  for (auto e : res) {
    cout << e << '\n';
  }
}