#include<bits/stdc++.h>
using namespace std;
const int Max_N=1e5;
const long long Mt=23,Mod=998244353;
int n1,n2,m,a[Max_N+5],b[Max_N+5];
long long Ml[Max_N+5];
struct Tree{
	int l[Max_N*4+5],r[Max_N*4+5],H[Max_N*4+5],T[Max_N*4+5],cnt[Max_N*4+5];
	long long M[Max_N*4+5];
	pair<int,long long> Find(int x,int w){
		if(H[x]>=w) return make_pair(cnt[x],M[x]);
		if(l[x]==r[x]) return make_pair(0,0);
		if(T[(x<<1)|1]>=w) {
			pair<int,long long> v=Find((x<<1)|1,w);
			v.second=(M[x<<1]*Ml[v.first]+v.second)%Mod;
			v.first+=cnt[x<<1];
			return v;
		}
		return Find(x<<1,w);
	}
	void Build(int x,int L,int R){
		l[x]=L; r[x]=R;
		if(l[x]==r[x]){
			H[x]=T[x]=M[x]=a[L];
			cnt[x]=1;
			return;
		}
		int mid=(L+R)>>1;
		Build(x<<1,L,mid);
		Build((x<<1)|1,mid+1,R);
		pair<int,long long> w=Find(x<<1,T[(x<<1)|1]);
		cnt[x]=w.first+cnt[(x<<1)|1];
		M[x]=(w.second*Ml[cnt[(x<<1)|1]]+M[(x<<1)|1])%Mod;
		H[x]=H[(x<<1)|1];
		T[x]=max(T[x<<1],T[(x<<1)|1]);
	}
	void Change(int x,int p,int val){
		if(l[x]==r[x]){
			H[x]=T[x]=M[x]=val;
			cnt[x]=1;
			return;
		}
		int mid=(l[x]+r[x])>>1;
		if(p<=mid) Change(x<<1,p,val);
		else Change((x<<1)|1,p,val);
		pair<int,long long> w=Find(x<<1,T[(x<<1)|1]);
		cnt[x]=w.first+cnt[(x<<1)|1];
		M[x]=(w.second*Ml[cnt[(x<<1)|1]]+M[(x<<1)|1])%Mod;
		H[x]=H[(x<<1)|1];
		T[x]=max(T[x<<1],T[(x<<1)|1]);
	}
} A,B;
int main(){
	Ml[0]=1;
	for(int i=1;i<=Max_N;i++) Ml[i]=Ml[i-1]*Mt%Mod;
	cin>>n1;
	for(int i=1;i<=n1;i++) cin>>a[i];
	A.Build(1,1,n1);
	cin>>n2;
	for(int i=1;i<=n2;i++) cin>>a[i];
	B.Build(1,1,n2);
	cin>>m;
	for(int i=1;i<=m;i++){
		int t,x,y; cin>>t>>x>>y;
		if(t==1) A.Change(1,x,y);
		else B.Change(1,x,y);
		if(A.M[1]==B.M[1]) puts("YES");
		else puts("NO");
	}
	return 0;
}