#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=j;i<=(k);++i)
#define MAXN 1000005
typedef long long ll;
int n1,n2,m;
const int p1=998244353,p2=1000000007;
ll pw1[MAXN],pw2[MAXN];
struct sgt{
	int seq[MAXN];
	struct data{
		int sz;
		ll v1,v2;
		inline void set(int x){
			sz=1,v1=v2=x;
		}
		inline bool operator == (const data &rhs)const{
		    return sz==rhs.sz&&v1==rhs.v1&&v2==rhs.v2;
		}
		inline data operator + (const data &rhs)const{
			if(!sz) return rhs;
			if(!rhs.sz) return *this;
			return (data){
				sz+rhs.sz,
				(v1*pw1[rhs.sz]+rhs.v1)%p1,
				(v2*pw2[rhs.sz]+rhs.v2)%p2
			};
		}
	};
	struct node{
		node *ls,*rs;
		int mx;
		data hash;
	}pool[MAXN<<1],*pos=pool,*root;
	#define mid (l+r>>1)
	#define lson tree->ls,l,mid
	#define rson tree->rs,mid+1,r
	inline data calc(node *tree,int l,int r,int val){
		if(tree->mx<val) return (data){0,0,0};
		if(l==r) return tree->hash;
		if(tree->ls->mx<val) return calc(rson,val);
		return tree->ls->hash+calc(rson,tree->ls->mx);
	}
	inline void pushup(node *tree,int l,int r){
		tree->mx=std::max(tree->ls->mx,tree->rs->mx);
		tree->hash=tree->ls->hash+calc(rson,tree->ls->mx);
	}
	inline void build(node *&tree,int l,int r){
		tree=++pos;
		if(l==r) return tree->mx=seq[l],tree->hash.set(seq[l]);
		else build(lson),build(rson),pushup(tree,l,r);
	}
	inline void update(node *tree,int l,int r,int x,int val){
		if(l==r) return tree->mx=val,tree->hash.set(val),void();
		if(x<=mid) update(lson,x,val);
		else update(rson,x,val);
		pushup(tree,l,r);
	}
}t1,t2;
int main(){
	std::ios::sync_with_stdio(0);
	std::cin.tie(0),std::cout.tie(0);
	std::cin>>n1;
	rep(i,1,n1) std::cin>>t1.seq[n1-i+1];
	std::cin>>n2;
	rep(i,1,n2) std::cin>>t2.seq[n2-i+1];
	pw1[0]=pw2[0]=1;
	rep(i,1,std::max(n1,n2)) pw1[i]=pw1[i-1]*100003%p1;
	rep(i,1,std::max(n1,n2)) pw2[i]=pw2[i-1]*100003%p2;
	t1.build(t1.root,1,n1),t2.build(t2.root,1,n2);
	std::cin>>m;
	while(m--){
		int opt,x,y;
		std::cin>>opt>>x>>y;
		if(opt==1) t1.update(t1.root,1,n1,n1-x+1,y);
		else t2.update(t2.root,1,n2,n2-x+1,y);
		std::cout<<(t1.root->hash==t2.root->hash?"YES\n":"NO\n");
	}
}