#include<bits/stdc++.h>

using namespace std;


const int N = 1e5 + 10;

uint64_t hsh[N];

struct sqrt_decompose {
    const int K = 150;

    int n, a[N];
    vector<int> st[N];
    vector<uint64_t> pref[N];

    void upd(int k) {
        k /= K;
        st[k].clear();
        pref[k].clear();
        int lb = k * K, rb = min(n, (k + 1) * K) - 1;
        for (int i = rb; i >= lb; --i) {
            if (st[k].empty() || st[k].back() <= a[i]) {
                st[k].push_back(a[i]);
            }
        }
        pref[k] = vector<uint64_t>(st[k].size() + 1, 0);
        for (int i = pref[k].size() - 2; i >= 0; --i) {
            pref[k][i] = pref[k][i + 1] + hsh[st[k][i]];
        }
    }

    void build() {
        for (int i = 0; i < n; i += K) {
            upd(i);
        }
    }

    uint64_t get() {
        int mx = 0;
        uint64_t res = 0;
        for (int i = (n - 1) / K; i >= 0; --i) {
            if (st[i].back() < mx) continue;
            int q = lower_bound(st[i].begin(), st[i].end(), mx) - st[i].begin();
            mx = st[i].back();
            res += pref[i][q];
        }
        return res;
    }
} s[2];

mt19937_64 rng(time(0));

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    for (int i = 0; i < N; ++i) {
        hsh[i] = rng();
    }

    for (int c = 0; c < 2; ++c) {
        cin >> s[c].n;
        for (int i = 0; i < s[c].n; ++i) {
            cin >> s[c].a[i];
        }
        s[c].build();
    }
    int q;
    cin >> q;
    while (q--) {
        int t, k, x;
        cin >> t >> k >> x;
        --t, --k;
        s[t].a[k] = x;
        s[t].upd(k);
        cout << (s[0].get() == s[1].get() ? "YES\n" : "NO\n");
    }
}