#include <iostream>
#include <vector>
#include <random>
#include <algorithm>
using namespace std;
using ll = long long;

const int bs = 750;
const int mn = 2e5+5;
const ll mod = 1e9+7;

mt19937_64 rng;

int vals[2][mn];
ll hashes[mn];
vector<pair<int, int>> blocks[2][mn/bs];
int n[2];

ll fix(ll n) {
	if (n >= mod) return n-mod;
	return n;
}
ll last[2];

void rebuild(int block, int o) {
	int start = bs*block;
	int blen = min(bs, n[o]-start);
	blocks[o][block].clear();
	for (int i = 0; i < blen; i++) {
		int val = vals[o][i+start];
		while (blocks[o][block].size() && val > blocks[o][block].back().first) blocks[o][block].pop_back();
		ll s = blocks[o][block].size() ? blocks[o][block].back().second : 0;
		blocks[o][block].push_back({val, fix(hashes[val] + s)});
	}
}

ll query(int o) {
	if (last[o] != -1) return last[o];
	int blockCnt = (n[o]+bs-1)/bs;
	ll hi = 0;
	ll out = 0;
	for (int i = blockCnt-1; i >= 0; i--) {
		auto ub = upper_bound(blocks[o][i].begin(), blocks[o][i].end(), pair<int, int>{ hi, -1 }, [&](auto a, auto b) { return a > b; });
		if (ub == blocks[o][i].begin()) continue;
		ub = prev(ub);
		out = fix(out+ub->second);
		hi = blocks[o][i][0].first;
	}
	last[o] = out;
	return out;
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	for (int i = 0; i < mn; i++) hashes[i] = rng()%mod;
	for (int i = 0; i < 2; i++) {
		last[i] = -1;
		cin >> n[i];
		for (int j = 0; j < n[i]; j++) cin >> vals[i][j];
		for (int j = 0; j*bs < n[i]; j++) rebuild(j, i);
	}

	int q; cin >> q;
	for (int i = 0; i < q; i++) {
		int o; cin >> o;
		o--;
		int x; cin >> x;
		x--;
		int y; cin >> y;
		last[o] = -1;
		vals[o][x] = y;
		rebuild(x/bs, o);
		if (query(0) == query(1)) cout << "YES" << '\n';
		else cout << "NO" << '\n';
	}
}