bzoj 2819

说好卡dfs的。。本来还想在选根上动下手脚，看来不用辣23333

身为蒟蒻怎么可能会博弈论，度娘告诉我们只需要判断异或和==0就行了

然后链剖+BIT就可以了（用BIT后链剖头一次这么短，不过我没感觉到就是了，BIT大法吼啊

貌似dfs序也能做，太弱了还不会。。

#include<bits/stdc++.h>
#define inc(i,l,r) for(int i=l;i<=r;i++)
#define dec(i,l,r) for(int i=l;i>=r;i--)
#define link(x) for(edge *j=h[x];j;j=j->next)
#define mem(a) memset(a,0,sizeof(a))
#define inf 1e9
#define ll long long
#define succ(x) (1<<x)
#define lowbit(x) (x&(-x))
#define NM 500000+5
using namespace std;
int read(){
    int x=0,f=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
    while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
    return x*f;
}
struct edge{
    int t;
    edge *next;
}e[2*NM],*h[NM],*o=e;
void add(int x,int y){
    o->t=y;o->next=h[x];h[x]=o++;
}
int n,d[NM],f[NM],id[NM],top[NM],TOP,son[NM],size[NM],tot;
int _x,_y,a[NM],b[NM],c[NM];
void dfs1(int x){
    link(x)if(!f[j->t]){
        f[j->t]=x;d[j->t]=d[x]+1;
        dfs1(j->t);
        size[x]+=size[j->t];
        if(size[j->t]>size[son[x]])son[x]=j->t;
    }
    size[x]++;
}
void dfs2(int x){
    top[x]=TOP;id[x]=++tot;
    if(son[x])dfs2(son[x]);
    link(x)if(!top[j->t])dfs2(TOP=j->t);
}
void upd(int x,int t){
    for(;x<=n;x+=lowbit(x))a[x]^=t;
}
int sum(int x){
    int s=0;
    for(;x;x-=lowbit(x))s^=a[x];
    return s;
}
void query(int x,int y){
    int s=0;
    for(;top[x]!=top[y];x=f[top[x]]){
        if(d[top[x]]<d[top[y]])swap(x,y);
        s^=sum(id[x])^sum(id[top[x]]-1);
    }
    if(d[x]<d[y])swap(x,y);
    s^=sum(id[x])^sum(id[y]-1);
    puts(s?"Yes":"No");
}
int main(){
    freopen("data.in","r",stdin);
    n=read();
    inc(i,1,n)c[i]=read();
    inc(i,1,n-1){
        _x=read();_y=read();add(_x,_y);add(_y,_x);
    }
    f[1]=1;dfs1(1);dfs2(TOP=1);
    inc(i,1,n)upd(id[i],c[i]),b[id[i]]=c[i];
    int m=read();
    while(m--){
        char st[10];scanf("%s",st);_x=read();_y=read();
        if(st[0]=='Q')query(_x,_y);
        else upd(id[_x],b[id[_x]]^_y),b[id[_x]]=_y;
//        inc(i,1,n)printf("%d ",b[i]);putchar('
');
//        inc(i,1,n)printf("%d ",a[i]);putchar('
');
    }
    return 0;
}