#include<bits/stdc++.h>
#define ls(x) (x<<1)
#define rs(x) (x<<1|1)
#define fir first
#define sec second
using namespace std;
typedef unsigned long long ull;
constexpr int M=1e5+5;
int q,op,x,y,tmp,n[2];ull pw[M];
struct segtree{int mx;pair<ull,int>hash;}tr[2][M<<2];
pair<ull,int> operator +(pair<ull,int>a,pair<ull,int>b){
    return {a.fir*pw[b.sec]+b.fir,a.sec+b.sec};
}
pair<ull,int> operator -(pair<ull,int>a,pair<ull,int>b){
    return {a.fir-b.fir,a.sec-b.sec};
}
int read(){
    int x=0;char ch=getchar();
    while (!isdigit(ch)) ch=getchar();
    while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
    return x;
}
pair<ull,int> calc(int l,int r,int x,int mx){
    if (l==r) return tr[op][x].mx>=mx?(pair<ull,int>){mx,1}:(pair<ull,int>){0,0};
    int mid=l+r>>1;
    if (tr[op][rs(x)].mx<mx) return calc(l,mid,ls(x),mx);
    return (tr[op][x].hash-tr[op][rs(x)].hash)+calc(mid+1,r,rs(x),tr[op][rs(x)].mx);
}
void pushup(int x,int l,int r){
    tr[op][x].mx=max(tr[op][ls(x)].mx,tr[op][rs(x)].mx);
    tr[op][x].hash=calc(l,l+r>>1,ls(x),tr[op][rs(x)].mx)+tr[op][rs(x)].hash;
}
void build(int l,int r,int x){
    if (l==r) return tmp=read(),tr[op][x].mx=tmp,tr[op][x].hash={tmp,1},void();
    int mid=l+r>>1;build(l,mid,ls(x));build(mid+1,r,rs(x)); pushup(x,l,r);
}
void update(int u,int c,int l,int r,int x){
    if (l==r) return tr[op][x].mx=c,tr[op][x].hash={c,1},void(); int mid=l+r>>1;
    u<=mid?update(u,c,l,mid,ls(x)):update(u,c,mid+1,r,rs(x)); pushup(x,l,r);
}
int main(){
    for (int i=pw[0]=1;i<M;i++) pw[i]=pw[i-1]*233;
    n[0]=read();op=0;build(1,n[0],1);
    n[1]=read();op=1;build(1,n[1],1);
    q=read();while (q--){
        op=read()-1;x=read();y=read();
        update(x,y,1,n[op],1);
        puts(tr[0][1].hash==tr[1][1].hash?"YES":"NO");
    }
    return 0;
}