#include <bits/stdc++.h>

using namespace std;

#define ff first
#define ss second
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()

using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128;
using u128 = unsigned __int128;

constexpr u64 M = 1E9 + 321;
constexpr u64 P = 998244353;
u64 mul(u64 a, u64 b) {
    return a * b % M;
}

struct Info {
    u64 val{}, pw{1};
};

Info operator+(const Info &a, const Info &b) {
    return Info{(a.val + mul(a.pw, b.val)) % M, mul(a.pw, b.pw)};
}

bool operator==(const Info &a, const Info &b) {
    return a.val == b.val and a.pw == b.pw;
}

const int Bsiz = 512;
struct Blk {
    const int n;
    vector<int> A;
    vector<vector<int>> stk;
    vector<Info> H;
    Blk(int _n) : n(_n), A(_n), H(_n) {
        stk.assign(n / Bsiz + 1, {});
        for (int i = 0; i * Bsiz < n; i++) {
            stk[i].reserve(Bsiz);
        }
    }
    void build(int k) {
        int l = k * Bsiz, r = min(n, l + Bsiz);
        stk[k].clear();
        for (int i = l; i < r; i++) {
            while (stk[k].size() and A[stk[k].back()] < A[i]) {
                stk[k].pop_back();
            }
            Info a{A[i], P};
            if (stk[k].size()) {
                a = H[stk[k].back()] + a;
            }
            H[i] = a;
            stk[k].push_back(i);
        }
    }
    void set(int p, int v) {
        A[p] = v;
        build(p / Bsiz);
    }
    Info get() {
        Info cur{};
        int v = -1;
        for (int i = (n - 1) / Bsiz; i >= 0; i--) {
            if (A[stk[i][0]] < v) {
                continue;
            }
            auto it = stk[i].end();
            if (A[stk[i].back()] < v) {
                it = ranges::partition_point(stk[i], 
                    [&](int x) {
                        return A[x] >= v;
                    });
            }
            if (it != stk[i].begin()) {
                it--;
                int p = *it;
                v = A[stk[i][0]];
                cur = H[p] + cur;
            }
        }
        return cur;
    }
};

void solve() {

    int n;
    cin >> n;
    Blk A(n);
    for (int i = 0; i < n; i++) {
        cin >> A.A[i];
    }

    int m;
    cin >> m;
    Blk B(m);
    for (int i = 0; i < m; i++) {
        cin >> B.A[i];
    }

    for (int i = 0; i * Bsiz < n; i++) {
        A.build(i);
    }
    for (int i = 0; i * Bsiz < m; i++) {
        B.build(i);
    }

    int q;
    cin >> q;
    while (q--) {
        int o, p, v;
        cin >> o >> p >> v;

        p--;
        if (o == 1) {
            A.set(p, v);
        } else {
            B.set(p, v);
        }

        auto a = A.get();
        auto b = B.get();

        if (a == b) {
            cout << "YES\n";
        } else {
            cout << "NO\n";
        }
    }
}

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

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}