#include <bits/stdc++.h>

#define rep(i,n) for(int i=0;i<n;++i)
#define repn(i,n) for(int i=1;i<=n;++i)
#define LL long long
#define pii pair <int,int>
#define fi first
#define se second
#define pb push_back
#define mpr make_pair

void fileio()
{
  #ifdef LGS
  freopen("in.txt","r",stdin);
  freopen("out.txt","w",stdout);
  #endif
}
void termin()
{
  #ifdef LGS
  std::cout<<"\n\nEXECUTION TERMINATED";
  #endif
  exit(0);
}

using namespace std;

const int B=400;

int n[2],m,a[2][100010];
vector <int> mx[2][1010];

LL H=11451419,pw[100010];
vector <LL> h[2][1010];

pii tmp[100010];
void reCons(int w,int b)
{
  int lb=b*B,ub=min(n[w],(b+1)*B)-1;
  for(int i=lb;i<=ub;++i) tmp[i]=mpr(a[w][i],-i);
  for(int i=ub;i>=lb;--i) tmp[i]=max(tmp[i],tmp[i+1]);
  int cur=lb;
  mx[w][b].clear();
  while(cur<=ub)
  {
    mx[w][b].pb(-a[w][-tmp[cur].se]);
    cur=-tmp[cur].se+1;
  }
  h[w][b].clear();
  LL curH=0;
  for(int i=0;i<mx[w][b].size();++i)
  {
    curH=curH*H+mx[w][b][i];
    h[w][b].pb(curH);
  }
}

LL calc(int w)
{
  int mxv=0,sz=0;
  LL ret=0;
  for(int i=(n[w]-1)/B;i>=0;--i)
  {
    if(-mx[w][i][0]<mxv) continue;
    int pos=lower_bound(mx[w][i].begin(),mx[w][i].end(),-mxv+1)-mx[w][i].begin()-1;
    mxv=-mx[w][i][pos];
    ret=ret+pw[sz]*h[w][i][pos];
    sz+=pos+1;
  }
  return ret;
}

int main()
{
  fileio();

  pw[0]=1;
  repn(i,100005) pw[i]=pw[i-1]*H;

  cin>>n[0];
  rep(i,n[0]) scanf("%d",&a[0][i]);
  cin>>n[1];
  rep(i,n[1]) scanf("%d",&a[1][i]);

  rep(i,(n[0]-1)/B+1) reCons(0,i);
  rep(i,(n[1]-1)/B+1) reCons(1,i);

  cin>>m;
  rep(qn,m)
  {
    int t,x,y;
    scanf("%d%d%d",&t,&x,&y);--t;--x;
    a[t][x]=y;
    reCons(t,x/B);
    LL ha=calc(0),hb=calc(1);
    puts(ha==hb ? "YES":"NO");
  }

  termin();
}