#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ull unsigned long long

//两个线段树，维护最大值，最大值的个数，最大值最靠右的地方

#define MAXN 100010

struct Segment
{
    int l, r;
    int maxval, nums, rightpos;
}tree1[MAXN  * 4], tree2[MAXN * 4];

int lc(int p)
{
    return p << 1;
}
int rc(int p)
{
    return p << 1 | 1;
}

void getup(Segment seg[], int p)
{
    if(seg[lc(p)].maxval == seg[rc(p)].maxval)
    {
        seg[p].maxval = seg[lc(p)].maxval;
        seg[p].nums = seg[lc(p)].nums + seg[rc(p)].nums;
        seg[p].rightpos = seg[rc(p)].rightpos;
    }
    else if(seg[lc(p)].maxval > seg[rc(p)].maxval)
    {
        seg[p].maxval = seg[lc(p)].maxval;
        seg[p].nums = seg[lc(p)].nums;
        seg[p].rightpos = seg[lc(p)].rightpos;
    }
    else
    {
        seg[p].maxval = seg[rc(p)].maxval;
        seg[p].nums = seg[rc(p)].nums;
        seg[p].rightpos = seg[rc(p)].rightpos;
    }
}

void build(Segment seg[], int p, int l, int r, const vector<int>& a)
{
    seg[p].l = l, seg[p].r = r;
    if(l == r)
    {
        seg[p].maxval = a[l], seg[p].nums = 1, seg[p].rightpos = l;
        return;
    }
    int mid = (l + r) >> 1;
    build(seg, lc(p), l, mid, a);
    build(seg, rc(p), mid + 1, r, a);
    getup(seg, p);
}

void update(Segment seg[], int p, int x, int y)
{
    if(seg[p].l == seg[p].r)
    {
        // assert(seg[p].l == x);
        seg[p].maxval = y, seg[p].nums = 1, seg[p].rightpos = seg[p].l;
        return;
    }
    int mid = (seg[p].l + seg[p].r) >> 1;
    if(x <= mid)
        update(seg, lc(p), x, y);
    else
        update(seg, rc(p), x, y);
    getup(seg, p);
}

void solve()
{
    int n1, n2;
    cin >> n1;
    vector<int> a1(n1 + 1);
    for (int i = 1; i <= n1; i++)
    {
        cin >> a1[i];
    }
    cin >> n2;
    vector<int> a2(n2 + 1);
    for (int i = 1; i <= n2; i++)
    {
        cin >> a2[i];
    }
    build(tree1, 1, 1, n1, a1);
    build(tree2, 1, 1, n2, a2);
    int m;
    cin >> m;
    while (m--)
    {
        int opt, x, y;
        cin >> opt >> x >> y;
        if(opt == 1)
            update(tree1, 1, x, y);
        else
            update(tree2, 1, x, y);
        if(tree1[1].maxval == tree2[1].maxval && tree1[1].nums == tree2[1].nums && n1 - tree1[1].rightpos == n2 - tree2[1].rightpos)
        {
            cout << "YES\n";
        }
        else
        {
            cout << "NO\n";
        }
    }
    
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
    }
}