#include<iostream>
#include<cstdio>
#define MN 500000
#define MD 19
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 * 10 + ch - '0';ch = getchar();}return x * f;
}int n,nl[MN+5],nr[MN+5],head[MN+5],dep[MN+5],p[MN+5],cnt=0,dn=0,S[MN+5],s[MN+5],fa[MD+1][MN+5];
struct edge{int to,next;}e[MN*2+5];
struct Tree{int l,r,x,val;}T[MN*4+5];
inline void ins(int f,int t)
{e[++cnt]=(edge){t,head[f]};head[f]=cnt;e[++cnt]=(edge){f,head[t]};head[t]=cnt;
}void build(int x,int l,int r)
{if((T[x].l=l)==(T[x].r=r)){T[x].x=S[p[l]];return;}int mid=l+r>>1;build(x<<1,l,mid);build(x<<1|1,mid+1,r);
}void modify(int x,int l,int r,int v)
{if(l==T[x].l&&T[x].r==r){T[x].x^=v;return;}int mid=T[x].l+T[x].r>>1;if(r<=mid) modify(x<<1,l,r,v);else if(l>mid) modify(x<<1|1,l,r,v);else modify(x<<1,l,mid,v),modify(x<<1|1,mid+1,r,v);
}int query(int x,int k)
{if(T[x].l==T[x].r) return T[x].x;int mid=T[x].l+T[x].r>>1;if(k<=mid) return query(x<<1,k)^T[x].x;else return query(x<<1|1,k)^T[x].x;
}void dfs(int x)
{p[nl[x]=++dn]=x;for(int i=head[x];i;i=e[i].next)if(e[i].to!=fa[0][x]){fa[0][e[i].to]=x;S[e[i].to]^=S[x];dep[e[i].to]=dep[x]+1;dfs(e[i].to);}nr[x]=dn;
}
int lca(int x,int y)
{if(dep[x]<dep[y]) swap(x,y);for(int k=dep[x]-dep[y],j=0;k;k>>=1,++j)if(k&1) x=fa[j][x];if(x==y) return x;for(int i=MD;~i;--i)if(fa[i][x]!=fa[i][y])x=fa[i][x],y=fa[i][y];return fa[0][x];
}
char op[5];
int main()
{n=read();for(int i=1;i<=n;i++) S[i]=s[i]=read();for(int i=1;i<n;i++) ins(read(),read());dfs(1);build(1,1,n);for(int i=1;i<=MD;i++)for(int j=1;j<=n;j++)fa[i][j]=fa[i-1][fa[i-1][j]];int q=read();for(int i=1;i<=q;i++){scanf("%s",op+1);int x=read(),y=read();if(op[1]=='Q') {int L=lca(x,y);int ans=query(1,nl[x])^query(1,nl[y])^s[L];puts(ans?"Yes":"No");}else modify(1,nl[x],nr[x],s[x]^y),s[x]=y;}return 0;
}