#pragma GCC optimize("O3","unroll-loops")
#pragma GCC target("avx","avx2","popcnt")
#include <bits/stdc++.h>

using namespace std;
#define int long long
#define app push_back
#define all(x) (x).begin(),(x).end()
#ifdef LOCAL
#define debug(...) [](auto...a){ ((cout << a << ' '), ...) << endl;}(#__VA_ARGS__, ":", __VA_ARGS__)
#else
#define debug(...)
#endif
#ifdef LOCAL
#define __int128 long long
#endif // LOCAL
#define bs bitset<65>
#define arr array<bitset<65>,65>
#define ull unsigned long long
mt19937_64 rnd;
const int maxn=1e5+5;
int b[maxn];
int ha[maxn];
pair<int,int> t2[4*maxn];
int get2(int node,int tl,int tr,int ma)
{
    if(tr-tl==1)
    {
        if(t2[node].first>=ma) {return t2[node].first;}
        else {return 0;}
    }
    int tm=(tl+tr)/2;
    if(t2[2*node+2].first>=ma) {return t2[node].second-t2[2*node+2].second+get2(2*node+2,tm,tr,ma);}
    return t2[2*node+2].second+get2(2*node+1,tl,tm,ma);
}
void upd2(int node,int tl,int tr)
{
    t2[node].first=max(t2[2*node+1].first,t2[2*node+2].first);
    int tm=(tl+tr)/2;
    t2[node].second=t2[2*node+2].second+get2(2*node+1,tl,tm,t2[2*node+2].first);
}
void build2(int node,int tl,int tr)
{
    if(tr-tl==1) {t2[node].first=b[tl];t2[node].second=ha[b[tl]];return;}
    int tm=(tl+tr)/2;
    build2(2*node+1,tl,tm);build2(2*node+2,tm,tr);
    upd2(node,tl,tr);
}
void to2(int node,int tl,int tr,int pos,int val)
{
    if(tl>pos || tr<=pos) return;
    if(tr-tl==1) {t2[node].first=val;t2[node].second=ha[val];return;}
    int tm=(tl+tr)/2;
    to2(2*node+1,tl,tm,pos,val);to2(2*node+2,tm,tr,pos,val);
    upd2(node,tl,tr);
}
pair<int,int> t1[4*maxn];int a[maxn];
int get1(int node,int tl,int tr,int ma)
{
    if(tr-tl==1)
    {
        if(t1[node].first>=ma) {return t1[node].first;}
        else {return 0;}
    }
    int tm=(tl+tr)/2;
    if(t1[2*node+2].first>=ma) {return t1[node].second-t1[2*node+2].second+get1(2*node+2,tm,tr,ma);}
    return t1[2*node+2].second+get1(2*node+1,tl,tm,ma);
}
void upd1(int node,int tl,int tr)
{
    t1[node].first=max(t1[2*node+1].first,t1[2*node+2].first);
    int tm=(tl+tr)/2;
    t1[node].second=t1[2*node+2].second+get1(2*node+1,tl,tm,t1[2*node+2].first);
}
void build1(int node,int tl,int tr)
{
    if(tr-tl==1) {t1[node].first=a[tl];t1[node].second=ha[a[tl]];return;}
    int tm=(tl+tr)/2;
    build1(2*node+1,tl,tm);build1(2*node+2,tm,tr);
    upd1(node,tl,tr);
}
void to1(int node,int tl,int tr,int pos,int val)
{
    if(tl>pos || tr<=pos) return;
    if(tr-tl==1) {t1[node].first=val;t1[node].second=ha[val];return;}
    int tm=(tl+tr)/2;
    to1(2*node+1,tl,tm,pos,val);to1(2*node+2,tm,tr,pos,val);
    upd1(node,tl,tr);
}
int32_t main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    for(int i=0;i<maxn;++i) {ha[i]=rnd();}
    int n1;cin>>n1;
    for(int i=0;i<n1;++i) {cin>>a[i];}
    int n2;cin>>n2;
    for(int i=0;i<n2;++i) {cin>>b[i];}
    build1(0,0,n1);build2(0,0,n2);
    int q;cin>>q;
    while(q--)
    {
        int typ;cin>>typ;
        if(typ==1)
        {
            int pos,val;cin>>pos>>val;--pos;a[pos]=val;
            //to1(0,0,n1,pos,val);
        }
        else
        {
            int pos,val;cin>>pos>>val;--pos;b[pos]=val;
            //to2(0,0,n2,pos,val);
        }
        int ans1=0;int ans2=0;int ma1=0;int ma2=0;
        for(int i=n1-1;i>=0;--i) {if(a[i]>=ma1) {ma1=a[i];ans1+=ha[a[i]];}}
        for(int i=n2-1;i>=0;--i) {if(b[i]>=ma2) {ma2=b[i];ans2+=ha[b[i]];}}
        puts(ans1==ans2 ? "YES" : "NO");
    }
    return 0;
}