#include <bits/stdc++.h>
#define fr first
#define sc second
#define all(a) (a).begin(), (a).end()
#define unique(a) a.resize(unique(a.begin(), a.end()) - a.begin())

using namespace std;

#ifdef ONPC
mt19937 rnd(223);
#else
mt19937 rnd(chrono::high_resolution_clock::now()
			.time_since_epoch().count());
#endif

#define TIME (clock() * 1.0 / CLOCKS_PER_SEC)

using ll = long long;
using ld = double;

const int maxn = 1e5 + 100, inf = 1e9 + 100;

map<int, int> q[2];

int a[2][maxn];

void solve() {
    for (int i = 0; i < 2; i++) {
        int n;
        cin >> n;
        for (int j = 0; j < n; j++) {
            int w;
            cin >> w;
            a[i][j] = w;
            q[i][w]++;
        }
    }
    int zap;
    cin >> zap;
    while (zap--) {
        int o, x, y;
        cin >> o >> x >> y;
        o--;
        x--;
        q[o][a[o][x]]--;
        if (q[o][a[o][x]] == 0) {
            q[o].erase(a[o][x]);
        }
        a[o][x] = y;
        q[o][a[o][x]]++;
        if (*q[0].rbegin() != *q[1].rbegin())
            cout << "NO\n";
        else
            cout << "YES\n";
    }
}

int main() {
#ifdef ONPC
    freopen("../a.in", "r", stdin);
//    freopen("../a.out", "w", stdout);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout << fixed;
    cout.precision(20);
    solve();
    cerr << "\n\nConsumed " << TIME << endl;
}