#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

using namespace std;

typedef long long ll;
#define all(x) begin(x), end(x)
constexpr int INF = (1 << 30) - 1;
constexpr long long IINF = (1LL << 60) - 1;
constexpr int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

template <class T> istream& operator>>(istream& is, vector<T>& v) {
    for (auto& x : v) is >> x;
    return is;
}

template <class T> ostream& operator<<(ostream& os, const vector<T>& v) {
    auto sep = "";
    for (const auto& x : v) os << exchange(sep, " ") << x;
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = forward<U>(y), true); }

template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = forward<U>(y), true); }

template <class T> void mkuni(vector<T>& v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <class T> int lwb(const vector<T>& v, const T& x) { return lower_bound(begin(v), end(v), x) - begin(v); }

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    vector<int> a(n);
    cin >> a;
    int m;
    cin >> m;
    vector<int> b(m);
    cin >> b;

    map<int, int> mp1, mp2;
    for (int& val : a) mp1[val]++;
    for (int& val : b) mp2[val]++;

    int q;
    cin >> q;
    for (; q--;) {
        int t, x, y;
        cin >> t >> x >> y;
        x--;
        if (t == 1) {
            int pre = a[x];
            if (--mp1[pre] == 0) mp1.erase(pre);
            a[x] = y;
            mp1[y]++;
        } else {
            int pre = b[x];
            if (--mp2[pre] == 0) mp2.erase(pre);
            b[x] = y;
            mp2[y]++;
        }
        if (*mp1.rbegin() == *mp2.rbegin()) {
            int maxi = mp1.rbegin()->first;
            cout << (mp1[maxi] == mp2[maxi] ? "YES" : "NO") << '\n';
        } else
            cout << "NO\n";
    }
    return 0;
}