#include <bits/stdc++.h>

int main() {
    int n1, n2, m;
    std::map<int, int> cnt1;
    std::map<int, int> cnt2;

    scanf("%d", &n1);
    std::vector<int> a(n1);
    for (int i = 0; i < n1; i++) {
        scanf("%d", &a[i]);
        cnt1[a[i]]++;
    }

    scanf("%d", &n2);
    std::vector<int> b(n2);
    for (int i = 0; i < n2; i++) {
        scanf("%d", &b[i]);
        cnt2[b[i]]++;
    }

    auto work = [&]() {
        int v = a.back();
        if (a.back() != b.back()) {
            return false;
        }
        auto it1 = cnt1.find(v);
        auto it2 = cnt2.find(v);

        while (it1 != cnt1.end() && it2 != cnt2.end()) {
            if (it1->first != it2->first || it1->second != it2->second) {
                return false;
            }
            it1++, it2++;
        }
        return it1 == cnt1.end() && it2 == cnt2.end();
    };

    scanf("%d", &m);
    while (m--) {
        int o, x, y;
        scanf("%d%d%d", &o, &x, &y);
        x--;
        if (o == 1) {
            if (--cnt1[a[x]] == 0) {
                cnt1.erase(a[x]);
            }
            a[x] = y;
            cnt1[a[x]]++;
        } else {
            if (--cnt2[b[x]] == 0) {
                cnt2.erase(b[x]);
            }
            b[x] = y;
            cnt2[b[x]]++;
        }
        // for (int j = 0; j < n1; j++) {
        //     printf("%d%c", a[j], " \n"[j == n1 - 1]);
        // }
        // for (int j = 0; j < n2; j++) {
        //     printf("%d%c", b[j], " \n"[j == n2 - 1]);
        // }
        puts(work() ? "YES" : "NO");
    }

    return 0;
}