#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a),i##END=(b);i<=i##END;i++)
#define Rof(i,b,a) for(int i=(b),i##END=(a);i>=i##END;i--)
#define go(u) for(int i=head[u];i;i=nxt[i])
#define int long long
#define pi pair<int,int>
#define fi first
#define se second
using namespace std;
inline int read(){
	int x=0,f=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
	return x*f;
}
const int N=1e5+10,p1=998244353,p2=147744151,base=114514123;
int n1,n2,q;
int pw1[N],pw2[N];
int a1[N],a2[N];
struct Tree{
	#define ls (k<<1)
	#define rs (k<<1|1)
	int mx[N<<2],len[N<<2],h1[N<<2];
	pi calc(int k,int l,int r,int pre){
		if(l==r)return pi(mx[k]>=pre,mx[k]>=pre?mx[k]:0);
		int m=l+r>>1;
		if(mx[ls]<=pre)return calc(rs,m+1,r,pre);
		else{
			pi o=calc(ls,l,m,pre),ret;
			ret.fi=o.fi+len[k]-len[ls];
			ret.se=(o.se*pw1[len[k]-len[ls]]+h1[rs])%p1;
			return ret;
		}
	}
	void up(int k,int l,int r){
		int m=l+r>>1;
		mx[k]=max(mx[ls],mx[rs]);
		pi o=calc(rs,m+1,r,mx[ls]);
		len[k]=len[ls]+o.fi;
		h1[k]=(h1[ls]*pw1[o.fi]+o.se)%p1;
	}
	void build(int k,int l,int r,int* a){
		if(l==r)return mx[k]=h1[k]=a[l],len[k]=1,void();
		int m=l+r>>1;
		build(ls,l,m,a),build(rs,m+1,r,a);
		up(k,l,r);
	}
	void mdf(int k,int l,int r,int x,int v){
		if(l==r)return mx[k]=v,h1[k]=v,void();
		int m=l+r>>1;
		x<=m?mdf(ls,l,m,x,v):mdf(rs,m+1,r,x,v);
		up(k,l,r);
	}
}T1,T2;
signed main(){
	pw1[0]=pw2[0]=1;
	For(i,1,N-1)
		pw1[i]=pw1[i-1]*base%p1,
		pw2[i]=pw2[i-1]*base%p2;
	For(i,1,n1=read())a1[i]=read();
	reverse(a1+1,a1+1+n1);
	T1.build(1,1,n1,a1);
	For(i,1,n2=read())a2[i]=read();
	reverse(a2+1,a2+1+n2);
	T2.build(1,1,n2,a2);
	q=read();
	while(q--){
		int op=read(),x=read(),y=read();
		if(op==1)T1.mdf(1,1,n1,n1-x+1,y);
		else T2.mdf(1,1,n2,n2-x+1,y);
		puts(T1.h1[1]==T2.h1[1]?"YES":"NO");
	}
	return 0;
}