不要在意奇奇怪怪的变量名！！！

#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
const int SIZE=4e5+10;
int n,col[SIZE],loc[SIZE],m;
vector<int> G[SIZE];
int dep[SIZE],fh[SIZE],siz[SIZE];
int wson[SIZE],toch[SIZE],dfn[SIZE],dft;
void dfs(int u,int fa){
    siz[u]=1,dep[u]=dep[fa]+1,fh[u]=fa;
    for(int v:G[u]){
        if(v==fa) continue;
        dfs(v,u);
        siz[u]+=siz[v];
        if(siz[wson[u]]<siz[v]) wson[u]=v;
    }
}
void subd(int u,int top){
    toch[u]=top,dfn[u]=++dft;
    if(wson[u]==0) return;
    subd(wson[u],top);
    for(int v:G[u]){
        if(v==fh[u]||v==wson[u]) continue;
        subd(v,v);
    }
}
struct omg{
    int lf,rt;
    mutable int val;
    omg(int l,int r=-1,int v=0):lf(l),rt(r),val(v){}
    bool operator<(const omg &rhs)const{
        return lf<rhs.lf;
    }
};
set<omg> wtf;
typedef set<omg>::iterator iter;
iter split(int pos){
    iter it=wtf.lower_bound(omg(pos));
    if(it!=wtf.end()&&it->lf==pos) return it;
    it--;
    int lf=it->lf,rt=it->rt,val=it->val;
    wtf.erase(it);
    wtf.insert(omg(lf,pos-1,val));
    return wtf.insert(omg(pos,rt,val)).first;
}
void assign(int lf,int rt,int val){
    iter itr=split(rt+1),itl=split(lf);
    wtf.erase(itl,itr);
    wtf.insert(omg(lf,rt,val));
}
int popcount(unsigned long long x){
    int ans=0;
    while(x!=0) ans+=(x%2),x/=2;
    return ans;
}
int main(){
    cin>>n>>m;
    for(int i=1;i<=n;i++) cin>>loc[i];
    for(int i=1;i<n;i++){
        int u,v;
        cin>>u>>v;
        G[u].push_back(v);
        G[v].push_back(u);
    }
    dfs(1,1),subd(1,1);
    for(int i=1;i<=n;i++) col[dfn[i]]=loc[i];
    int st=1,cl=col[1];
    for(int i=2;i<=n;i++) if(col[i]!=cl){
        wtf.insert(omg(st,i-1,cl));
        st=i,cl=col[i];
    }
    wtf.insert(omg(st,n,cl));
    while(m--){
        int o,u,c;
        cin>>o>>u;
        if(o==1){
            cin>>c;
            assign(dfn[u],dfn[u]+siz[u]-1,c);
        }else{
            int lf=dfn[u],rt=dfn[u]+siz[u]-1;
            unsigned long long colt=0;
            iter itr=split(rt+1),itl=split(lf);
            for(iter it=itl;it!=itr;++it){
                colt|=(1ull<<(unsigned long long)(it->val));
                if(colt+1ull==0ull) break;
            }
            cout<<popcount(colt)<<endl;
        }
    }
    return 0;
}