#include<bits/stdc++.h>
using namespace std;
#define debug cout<<"YES\n";
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxn=1e5+100;
const int lz=0;
const ll INF=1e18;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){if(y==0) return x;return gcd(y,x%y);}
///存图
vector<pii> g[maxn];
///线段树结构
#define q(x) q_query(1,tim,1,x)
int n,w[maxn],val[maxn],m;
int cntt[maxn<<2],lazy[maxn<<2],lc[maxn<<2],rc[maxn<<2];///左右值
void pushdown(int x){
if(lazy[x]!=lz){
lazy[x<<1]=lazy[x<<1|1]=lazy[x];
cntt[x<<1]=cntt[x<<1|1]=1;
lc[x<<1]=lc[x<<1|1]=lazy[x];
rc[x<<1]=rc[x<<1|1]=lazy[x];
lazy[x]=lz;
}
}
void pushup(int x){
cntt[x]=cntt[x<<1]+cntt[x<<1|1]-(lc[x<<1|1]==rc[x<<1]);
lc[x]=lc[x<<1],rc[x]=rc[x<<1|1];
}
void build(lrt){
lazy[rt]=lz;
if(l==r) {cntt[rt]=1,lc[rt]=rc[rt]=w[l];return;}
int mid=l+r>>1;
build(lson),build(rson),pushup(rt);
pushup(rt);
}
void update(lrt,int L,int R,int v){
if(L>R) return ;
if(L<=l&&r<=R){
cntt[rt]=1;
lc[rt]=rc[rt]=lazy[rt]=v;
return ;
}
pushdown(rt);/
int mid=l+r>>1;
if(L<=mid) update(lson,L,R,v);
if(mid<R) update(rson,L,R,v);
pushup(rt);
}
int query(lrt,int L,int R){
if(L<=l&&r<=R) return cntt[rt];
pushdown(rt);
int mid=l+r>>1,ans=0;
if(L<=mid) ans+=query(lson,L,R);
if(mid<R) ans+=query(rson,L,R);
//pushup(rt);
if(L<=mid&&mid<R) if(lc[rt<<1|1]==rc[rt<<1]) ans--;
return ans;
}
int q_query(lrt,int x){
if(l==r) return lc[rt];
pushdown(rt);
int mid=l+r>>1;
if(x<=mid) return q_query(lson,x);
else return q_query(rson,x);
}
///第一次dfs
int fa[maxn],dep[maxn],sz[maxn],son[maxn];
void dfs1(int u,int f){
sz[u]=1,fa[u]=f,dep[u]=dep[f]+1;
rep(i,0,g[u].size()){
int v=g[u][i].fi;
if(v==f) continue;
dfs1(v,u);
sz[u]+=sz[v];
if(sz[v]>sz[son[u]]) son[u]=v;
}
}
///第二次dfs
int tim,dfn[maxn],top[maxn];
void dfs2(int u,int f,int pre){///这里的f是top的意思
dfn[u]=++tim,top[u]=f,w[tim]=pre;
int tmp=0;
rep(i,0,g[u].size()){
if(g[u][i].fi==son[u]){
tmp=g[u][i].se;
break;
}
}
if(son[u]) dfs2(son[u],f,tmp);
rep(i,0,g[u].size()){
int v=g[u][i].fi;
if(v==fa[u]||v==son[u]) continue;/坑点
dfs2(v,v,g[u][i].se);
}
}
///对链操作
void modify(int x,int y,int z){
while(top[x]^top[y]){
if(dep[top[x]]<dep[top[y]]) swap(x,y);
update(1,tim,1,dfn[top[x]],dfn[x],z);
x=fa[top[x]];
}
if(dep[x]>dep[y]) swap(x,y);
if(x==y) return ;/坑点
update(1,tim,1,dfn[son[x]],dfn[y],z);
}
int query(int x,int y){
int ans=0,prex=-1,prey=-1;
while(top[x]^top[y]){
if(dep[top[x]]<dep[top[y]]) swap(x,y),swap(prex,prey);
ans+=query(1,tim,1,dfn[top[x]],dfn[x]);
if(prex==q(dfn[x])) ans--;
prex=q(dfn[top[x]]),x=fa[top[x]];
}
if(dep[x]>dep[y]) swap(x,y),swap(prex,prey);
if(x==y) return ans-(prex==prey);
ans+=query(1,tim,1,dfn[son[x]],dfn[y]);
if(q(dfn[son[x]])==prex) ans--;
if(q(dfn[y])==prey) ans--;
return ans;
}
int main(){
ios::sync_with_stdio(false);
while(cin>>n>>m){
rep(i,1,n+1){/一定要初始化,多样例的时候
g[i].clear();
top[i]=fa[i]=son[i]=sz[i]=dep[i]=0;
}
rep(i,1,n){
int x,y,z;
cin>>x>>y>>z;z++;
g[x].push_back(mk(y,z));
g[y].push_back(mk(x,z));
}
tim=0;多样例初始化
dfs1(1,0),dfs2(1,1,0);
build(1,tim,1);
int x,y,z;
while(m--){
string s;
cin>>s>>x>>y;
if(s[0]=='Q') cout<<query(x,y)<<"\n";
else{
cin>>z;z++;
modify(x,y,z);
}
}
}
return 0;
}