#include <bits/stdc++.h>

int main() {
    int n1, n2, m;

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

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

    auto work = [&]() {
        std::vector<int> ans1, ans2;
        int mx = 0;
        for (int x : a | std::views::reverse) {
            mx = std::max(mx, x);
            if (mx == x) {
                ans1.push_back(mx);
            }
        }
        for (mx = 0; int x : b | std::views::reverse) {
            mx = std::max(mx, x);
            if (mx == x) {
                ans2.push_back(mx);
            }
        }
        // for (int i = 0; i < ans1.size(); i++) {
        //     printf("%d", ans1[i]);
        // }
        // puts("");
        // for (int i = 0; i < ans1.size(); i++) {
        //     printf("%d", ans2[i]);
        // }
        // puts("");

        return ans1 == ans2;
    };

    scanf("%d", &m);
    while (m--) {
        int o, x, y;
        scanf("%d%d%d", &o, &x, &y);
        x--;
        if (o == 1) {
            a[x] = y;
        } else {
            b[x] = y;
        }
        puts(work() ? "YES" : "NO");
    }

    return 0;
}