#include<bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
typedef long long ll;
using namespace std;
typedef pair<int,int> pii;

const int nmods=2;
const int mods[nmods]={998244353,1000000007};
int mod=998244353;
inline int add(int x,int y){int ret=x+y;if(ret>=mod)ret-=mod;return ret;}
inline int sub(int x,int y){int ret=x-y;if(ret<0)ret+=mod;return ret;}
inline int mul(int x,int y){return ((ll)x*y)%mod;}
inline int step(int base,int pw){int ret=1;while(pw){if(pw&1)ret=mul(ret,base);base=mul(base,base);pw>>=1;}return ret;}
inline int invv(int x){return step(x,mod-2);}

const int base[nmods]={1543267,9832841};

const int N=100050;
int po[nmods][N];

const int S=300;
const int B=N/S+50;
struct Arr{
    int a[N],n;
    vector<int> blk[B];
    vector<int> hsh[nmods][B];
    int ptr[B];

    bool changed;
    array<int,nmods> saved;
    int was_sz;

    Arr(){}

    void Read(){
        scanf("%i",&n);
        for(int i=0;i<n;i++)scanf("%i",&a[i]);
    }
    void Build(){
        for(int i=0;i*S<n;i++)BuildBlock(i);
        changed=true;
    }
    void BuildBlock(int b){
        int l=b*S;
        int r=min(n,b*S+S)-1;
        blk[b].clear();
        int mx=0;
        for(int i=r;i>=l;i--){
            if(a[i]>=mx){
                mx=a[i];
                blk[b].pb(a[i]);
            }
        }
        reverse(blk[b].begin(),blk[b].end());
        for(int j=0;j<nmods;j++){
            mod=mods[j];
            hsh[j][b].clear();
            hsh[j][b].pb(0);
            for(int i=0;i<blk[b].size();i++){
                hsh[j][b].push_back(add(mul(hsh[j][b].back(),base[j]),blk[b][i]));
            }
        }
        ptr[b]=0;
    }
    pair<array<int,nmods>,int> Get(){
        if(!changed)return {saved,was_sz};
        int fir=(n-1)/S;
        int mx=blk[fir][0];
        array<int,nmods> ans;
        for(int j=0;j<nmods;j++)ans[j]=hsh[j][fir].back();
        int sz=blk[fir].size();
        for(int i=fir-1;i>=0;i--){
            if(mx>blk[i][0])ptr[i]=0;
            else{
                while(ptr[i]>0 && blk[i][ptr[i]-1]<mx)ptr[i]--;
                while(ptr[i]<blk[i].size() && blk[i][ptr[i]]>=mx)ptr[i]++;
            }
            for(int j=0;j<nmods;j++){
                mod=mods[j];
                ans[j]=add(ans[j],mul(po[j][sz],hsh[j][i][ptr[i]]));
            }
            sz+=ptr[i];
        }
        saved=ans;
        was_sz=sz;
        changed=false;
        return {ans,sz};
    }
    void Upd(int i,int x){
        a[i-1]=x;
        BuildBlock((i-1)/S);
        changed=true;
    }
}A[2];


int main(){
    for(int j=0;j<nmods;j++){
        mod=mods[j];
        po[j][0]=1;
        for(int i=1;i<N;i++)po[j][i]=mul(po[j][i-1],base[j]);
    }
    A[0].Read();
    A[1].Read();
    A[0].Build();
    A[1].Build();
    int q;
    scanf("%i",&q);
    while(q--){
        int o,x,y;
        scanf("%i %i %i",&o,&x,&y);
        A[o-1].Upd(x,y);
        if(A[0].Get()==A[1].Get())printf("YES\n");
        else printf("NO\n");
    }
    return 0;
}