#include <algorithm>
#include <array>
#include <iostream>
#include <random>

using namespace std;

constexpr int N = 1e5, B = 1024;

uint32_t remap[N + 1];

struct Player {
  int a[N];
  array<int, 3> nx[N];
  vector<int> st;
  vector<array<int, 2>> d, civ;
  int h;

  void rebuild() {
    int ma = 1, sz0 = 1, sz1 = 0;
    civ.assign(N + 1, array{N, 0});
    st.assign(N, 0);
    for (int i = N; i--; ) {
      if (a[i] >= ma) {
        ma = a[i];
        civ[sz0++] = {i, ma};
      }
      while (sz1 && a[st[sz1 - 1]] <= a[i]) --sz1, nx[st[sz1]] = {i, remap[a[st[sz1]]], a[st[sz1]]};
      st[sz1++] = i;
    }
    civ.resize(sz0);
    while (sz1--) nx[st[sz1]] = {-1, remap[a[st[sz1]]], a[st[sz1]]};
    for (int i = 0, j = -1; i < N; ++i) {
      if (j + 1 < d.size() && i >= d[j + 1][0]) ++j;
      if (~j && nx[i][0] > d[j][0]) nx[i][1] += nx[nx[i][0]][1], nx[i][2] = nx[nx[i][0]][2], nx[i][0] = nx[nx[i][0]][0];
    }
    for (auto [i, v]: d) calcnx(i, v);
    recalc();
  }

  void upd(int i, int v) {
    int j = 0;
    while (j < d.size() && d[j][0] < i) ++j;
    if (j < d.size() && d[j][0] == i) d[j][1] = v;
    else d.insert(d.begin() + j, array{i, v});
  }

  void calcnx(int i, int v) {
    int p = 0, s = 2 << __lg(civ.size());
    while (s /= 2) if (p + s < civ.size() && (civ[p + s][0] >= i || civ[p + s][1] < v)) p += s;
    nx[i][0] = p + 1 == civ.size()? -1: civ[p + 1][0];
  }

  void recalc() {
    int i = N - 1, ma = 0, j = d.size() - 1, h = 0;
    while (~i || ~j) {
      while (~j && ma > d[j][1]) --j;
      if (~j && i <= d[j][0]) {
        ma = d[j][1];
        h += remap[ma];
        i = nx[d[j--][0]][0];
      } else {
        ma = nx[i][2];
        h += nx[i][1];
        i = nx[i][0];
      }
    }
    this->h = h;
  }
} p[2];

int main() {
  cin.tie(0)->sync_with_stdio(0);
  generate(remap + 1, remap + N + 1, mt19937(2312331));
  for (auto t: {0, 1}) if (int n = (cin >> n, n); 1) for (int i = 0; i < n; ++i) cin >> p[t].a[i];
  int m = 2e5; cin >> m;
  vector<array<int, 3>> qs;
  while (m--) {
    {
      int a, b, c; cin >> a >> b >> c; --a, --b;
      qs.push_back({a, b, c});
    }
    if (m % B) continue;
    p[0].d.clear();
    p[1].d.clear();
    for (auto [t, x, y]: qs) p[t].upd(x, p[t].a[x]);
    for (auto [t, x, y]: qs) p[t].a[x] = 0;
    p[0].rebuild();
    p[1].rebuild();
    for (auto [t, x, y]: qs) p[t].upd(x, y), p[t].calcnx(x, y), p[t].recalc(), cout << (p[0].h == p[1].h? "YES\n": "NO\n");
    for (auto [t, x, y]: qs) p[t].a[x] = y;
    qs.clear();
  }
}