#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); i++)
#define Rep(i, a, b) for (int i = a; i >= (b); i--)
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second
#define SZ(x) (int)(x.size())
#define lowbit(x) ((x) & -(x))
using db = double;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
using i128 = __int128_t;
// Think twice, code once

mt19937_64 mrand(time(nullptr));
const int N = 1e5 + 5;
ll val[N];
struct SegmentTree {
    ll h[N << 2];
    int mn[N << 2], mx[N << 2];
    #define ls (rt << 1)
    #define rs (rt << 1 | 1)
    ll geth(int rt, int x) {
        if (mx[rt] < x) return 0;
        if (mn[rt] >= x) return h[rt];
        if (mx[rs] >= x) return geth(rs, x);
        return geth(ls, x);
    }
    void push_up(int rt) {
        mn[rt] = min(mn[ls], mn[rs]);
        mx[rt] = max(mx[ls], mx[rs]);
        ll hl = geth(ls, mx[rs]);
        h[rt] = hl ^ h[rs];
    }
    void modify(int rt, int l, int r, int x, int d) {
        if (l == r) {
            mn[rt] = mx[rt] = d;
            h[rt] = val[d]; return;
        }
        int md = (l + r) >> 1;
        if (x <= md) modify(ls, l, md, x, d);
        else modify(rs, md + 1, r, x, d);
        push_up(rt);
    }
} tr[2];
void solve() {
    rep(o, 0, 2) {
        int n; cin >> n;
        rep(i, 1, n + 1) {
            int a; cin >> a;
            tr[o].modify(1, 1, N, i, a);
        }
    }
    int q; cin >> q;
    while (q--) {
        int o, x, y; cin >> o >> x >> y; o--;
        tr[o].modify(1, 1, N, x, y);
        if (tr[0].h[1] == tr[1].h[1]) cout << "YES\n";
        else cout << "NO\n";
    }
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    rep(i, 1, N) val[i] = mrand();
    int T = 1;
    // cin >> T;
    while (T--) solve();
    return 0;
}