#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<math.h>
#include<map>
#include<iostream>
#include<string>
#include<vector>
using namespace std;
#define L long longvector<int >q[100050];int p[100050];
int fp[100050];
int fa[100050];
int son[100050];
int deep[100050];
int top[100050];
int num[100050];
int n , m , pp;
int pos;
void init(){for(int i= 1;i<=n;i++){q[i].clear();}memset(son , -1 ,sizeof(son));pos = 0;
}
int in[100050];
void dfs(int u , int pre , int d){deep[u] = d;fa[u] = pre;num[u] = 1;for(int i = 0;i<q[u].size();i++){int v = q[u][i];if(v != pre){dfs(v,u,d+1);num[u] += num[v];if(son[u] == -1 || num[v] > num[son[u]]){son[u] = v;}}}
}void dfs2(int u , int zx){top[u] = zx;p[u] = pos ++;fp[pos - 1] = u;if(son[u] == -1){return ;}dfs2(son[u],zx);for(int i = 0;i<q[u].size();i++){int v = q[u][i];if(v != fa[u] && v != son[u]){dfs2(v,v);}}
}
/**
线段树 1求一个区间内有多少个颜色 2求一个点的颜色
2直接写查询
1记录这个区间的 中间的两个的颜色
*/
struct node{int l,r;int ml;int mr;int ll ;int rr ;int mark;int d;
}tr[100050 * 4];
void pushup(int i){if(tr[i].l == tr[i].r)return ;tr[i].ll = tr[i<<1].ll;tr[i].rr = tr[(i<<1)|1].rr ;tr[i].ml = tr[i<<1].rr;tr[i].mr = tr[(i<<1)|1].ll ;tr[i].d = tr[i<<1].d + tr[(i<<1)|1].d ;if(tr[i<<1].rr == tr[(i<<1)|1].ll)tr[i].d -- ;
}
void pushdown(int i){if(tr[i].l == tr[i].r)return ;if(tr[i].mark != 0){tr[i<<1].mark = tr[(i<<1)|1].mark = tr[i].mark ;tr[i<<1].ll = tr[i<<1].rr = tr[i<<1].ml = tr[i<<1].mr = tr[i].mark;tr[(i<<1)|1].ll = tr[(i<<1)|1].rr = tr[(i<<1)|1].ml = tr[(i<<1)|1].mr = tr[i].mark;tr[i<<1].d= tr[(i<<1)|1].d = 1;tr[i].mark = 0;}
}
void crea(int i , int l , int r){tr[i].l = l ;tr[i].r = r;tr[i].ml = tr[i].mr = tr[i].ll = tr[i].rr = tr[i].mark = 0;if(l == r){tr[i].ml = tr[i].mr = tr[i].ll = tr[i].rr = in[fp[l]];tr[i].d = 1;return ;}int mid = (l + r )/ 2;crea(i<<1,l,mid);crea((i<<1)|1,mid+1,r);pushup(i);
}
int res ;
void upda(int i ,int l ,int r , int c){if(tr[i].l ==l && r == tr[i].r){tr[i].ml = tr[i].mr = tr[i].ll = tr[i].rr = tr[i].mark = c;tr[i].d = 1;return ;}pushdown(i);int mid = (tr[i].l + tr[i].r) / 2;if(r <= mid){upda(i<<1,l,r,c);}else if(l > mid){upda((i<<1)|1,l,r,c);}else {upda(i<<1,l,mid,c);upda((i<<1)|1,mid+1,r,c);}pushup(i);
}
int query(int i ,int l ,int r){if(tr[i].l == l && r == tr[i].r){return tr[i].d;}pushdown(i);int mid = (tr[i].l + tr[i].r) / 2;if(r <= mid){return query(i<<1,l,r);}else if(l > mid){return query((i<<1)|1,l,r);}else {if(tr[i].ml == tr[i].mr){return query(i<<1,l,mid) + query((i<<1)|1,mid+1,r) - 1;}else {return query(i<<1,l,mid) + query((i<<1)|1,mid+1,r);}}
}
int qu2(int i ,int pos){if(tr[i].l == tr[i].r){return tr[i].ml ;}pushdown(i);int mid = (tr[i].l + tr[i].r) / 2;if(pos <= mid){return qu2(i<<1,pos);}else {return qu2((i<<1)|1,pos);}
}
void did(int u , int v, int c){int f1 = top[u];int f2 = top[v];while(f1 != f2){if(deep[f1] < deep[f2]){swap(f1,f2);swap(u,v);}upda(1,p[f1],p[u],c);u = fa[f1];f1 = top[u];}if(deep[u] < deep[v]){swap(u,v);}upda(1,p[v],p[u],c);
}
int slpf(int u, int v){int ans = 0;int f1 = top[u];int f2 = top[v];int ys1 = -1;int ys2 = -1;while(f1 != f2){if(deep[f1] < deep[f2]){swap(u,v);swap(f1,f2);swap(ys1,ys2);}ans += query(1,p[f1],p[u]);if(ys1 == qu2(1,p[u])){ans -- ;}ys1 = qu2(1,p[f1]);u = fa[f1];f1 = top[u];//printf("%d\n",ans);}if(deep[u] < deep[v]){swap(u,v);swap(ys1,ys2); /// --------}ans += query(1,p[v],p[u]);if(ys1==qu2(1,p[u])){ans -- ;}if(ys2==qu2(1,p[v])){ans -- ;}return ans ;
}
int main(){//freopen("in.cpp","r",stdin);while(scanf("%d%d",&n,&pp)!=EOF){init();for(int i=1;i<=n;i++){scanf("%d",&in[i]);}for(int i=1;i<=n-1;i++){int u , v;scanf("%d%d",&u,&v);q[u].push_back(v);q[v].push_back(u);}dfs(1,0,0);dfs2(1,1);crea(1,0,pos-1);for(int i=1;i<=pp;i++){char s[20];scanf("%s",s);if(s[0] == 'C'){int u , v, c;scanf("%d%d%d",&u,&v,&c);did(u,v,c);}else {int u,v;scanf("%d%d",&u,&v);printf("%d\n",slpf(u,v));}}}
}

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<math.h>
#include<map>
#include<iostream>
#include<string>
#include<vector>
#include<queue>
using namespace std;
#define L long longconst int maxn = 100050 ;int top[maxn] , fa[maxn] , deep[maxn] , num[maxn] , p[maxn] , fp[maxn] , son[maxn] ;
int pos ;
int n ;
int a[maxn] ;
bool can ;vector<int > q[maxn] ;
vector<int > w[maxn] ;vector<int > tmp ;void init() {pos = 1 ;memset(son , -1 , sizeof(son)) ;for(int i = 1 ; i <= n ; i ++ ) q[i].clear() ;for(int i = 1 ; i <= n ; i ++ ) w[i].clear() ;
}void dfs1(int u , int pre , int d) {deep[u] = d ;fa[u] = pre ;num[u] = 1 ;for(int i = 0 ; i < q[u].size() ; i ++ ){int v = q[u][i] ;if(v != pre) {a[v] = w[u][i] ;dfs1(v,u,d+1);if(son[u] == -1 || num[v] > num[son[u]]) {son[u] = v ;}}}
}void getpos(int u , int sp) {top[u] = sp ;p[u] = pos ++ ;fp[p[u]] = u ;if(son[u] == -1) return ;getpos(son[u] , sp) ;for(int i = 0 ; i < q[u].size() ; i ++ ){int v = q[u][i];if(v != son[u] && v != fa[u]) {getpos(v,v) ;}}
}void slpf(int u ,int v ) {int f1 = top[u] , f2 = top[v] ;int sl = 0 ;while(f1 != f2) {if(deep[f1] < deep[f2]) {swap(f1 , f2) ;swap(u , v) ;}sl += ( p[u] - p[f1] + 1) ;if(sl > 65) {can = false ;return ;}else {for(int i = p[f1] ; i <= p[u] ; i ++ ){tmp.push_back(a[fp[i]]) ;}}u = fa[f1] ;f1 = top[u] ;}if(u == v) return ;if(deep[u] > deep[v]) swap(u , v) ;sl += (p[v] - p[son[u]] + 1) ;if(sl > 65) {can = false ;return ;}for(int i = p[son[u]] ; i <= p[v] ; i ++ ){tmp.push_back(a[fp[i]]) ;}
}int main(){while(scanf("%d" , &n) != EOF) {init() ;for(int i = 1 ; i < n ; i ++ ){int u , v , c ;scanf("%d%d%d",&u,&v,&c) ;q[u].push_back(v) ;q[v].push_back(u) ;w[u].push_back(c) ;w[v].push_back(c) ;}dfs1(1,0,0) ;getpos(1,1) ;a[1] = -9999999 ;int query ;scanf("%d",&query) ;for(int i = 1 ; i <= query ; i ++ ){int u , v ;scanf("%d%d",&u,&v) ;tmp.clear() ;can = true ;slpf(u , v) ;if(can == false) {printf("Yes\n") ;}else {sort(tmp.begin() , tmp.end()) ;bool ok = false ;if(tmp.size() < 3) {}else {for(int j = 2 ; j < tmp.size() ; j ++ ){int aa = tmp[j-2] ;int bb = tmp[j-1] ;int cc = tmp[j] ;if(aa + bb > cc) {ok=true;break ;}}}if(ok)printf("Yes\n");else printf("No\n") ;}}}
}