#include<bits/stdc++.h>

 using namespace std;

 typedef long long ll;

 const int N=1e5+;

 int n,m,a[N],col[N][],fa[N],ch[N][],sum[N],flp[N],sta[N],tp,lz[N];

 #define ls(u) ch[u][0]

 #define rs(u) ch[u][1]

 int sf(int u) {return u==rs(fa[u]);}

 bool isrt(int u) {return u!=ls(fa[u])&&u!=rs(fa[u]);}

 void pu(int u) {

     sum[u]=,col[u][]=col[u][]=a[u];

     for(int f=; f<; ++f)if(ch[u][f]) {

             sum[u]+=sum[ch[u][f]];

             col[u][f]=col[ch[u][f]][f];

             if(col[ch[u][f]][f^]==a[u])--sum[u];

         }

 }

 void change(int u,int x) {if(u)a[u]=col[u][]=col[u][]=lz[u]=x,sum[u]=;}

 void rev(int u) {flp[u]^=,swap(ls(u),rs(u)),swap(col[u][],col[u][]);}

 void pd(int u) {

     if(flp[u])rev(ls(u)),rev(rs(u)),flp[u]=;;

     if(~lz[u])change(ls(u),lz[u]),change(rs(u),lz[u]),lz[u]=-;

 }

 void rot(int u) {

     int v=fa[u],f=sf(u);

     if(!isrt(v))ch[fa[v]][sf(v)]=u;

     ch[v][f]=ch[u][f^],fa[ch[v][f]]=v;

     fa[u]=fa[v],ch[u][f^]=v,fa[v]=u,pu(v);

 }

 void splay(int u) {

     sta[tp=]=u;

     for(int v=u; !isrt(v); v=fa[v])sta[++tp]=fa[v];

     for(; ~tp; pd(sta[tp--]));

     for(; !isrt(u); rot(u))if(!isrt(fa[u])&&sf(fa[u])==sf(u))rot(fa[u]);

     pu(u);

 }

 void access(int u) {for(int v=; u; splay(u),rs(u)=v,pu(u),u=fa[v=u]);}

 void makert(int u) {access(u),splay(u),rev(u);}

 void link(int u,int v) {makert(u),fa[u]=v;}

 void split(int u,int v) {makert(u),access(v),splay(v);}

 int main() {

     scanf("%d%d",&n,&m);

     for(int i=; i<=n; ++i)scanf("%d",&a[i]),lz[i]=-,pu(i);

     for(int i=; i<n; ++i) {

         int u,v;

         scanf("%d%d",&u,&v);

         link(u,v);

     }

     while(m--) {

         char ch;

         int x,y,z;

         scanf(" %c%d%d",&ch,&x,&y);

         if(ch=='C')scanf("%d",&z),split(x,y),change(y,z);

         else split(x,y),printf("%d\n",sum[y]);

     }

     return ;

 }