// 那就是希望。
// 即便需要取模，也是光明。

// 不弱于教主的魔法，可以规约矩阵乘法，考虑根号。
// 根号重构 + 树剖分块。
// 维护添加点的联通块。
// 每次重构把当前树重新剖分，进行信息的更新。
// 然后两类加点操作可以“新开联通块”或者“联通块内重构结构”。（广义串并联图的方式？）
// 加权操作可以对整颗树上加，各个联通块内的点依次判断是否在修改链上，暴力修改即可。
// 查询操作可以树上使用树剖分块查询，额外点也查询。
// 总复杂度 O(n\sqrt{n\log n}) (n\sim q)

#include <algorithm>
#include <stdio.h>
#include <vector>
typedef long long llt;
typedef unsigned uint;typedef unsigned long long ullt;
typedef bool bol;typedef char chr;typedef void voi;
typedef double dbl;
template<typename T>bol _max(T&a,T b){return(a<b)?a=b,true:false;}
template<typename T>bol _min(T&a,T b){return(b<a)?a=b,true:false;}
template<typename T>T lowbit(T n){return n&-n;}
template<typename T>T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<typename T>T lcm(T a,T b){return(a!=0||b!=0)?a/gcd(a,b)*b:(T)0;}
template<typename T>T exgcd(T a,T b,T&x,T&y){if(b!=0){T ans=exgcd(b,a%b,y,x);y-=a/b*x;return ans;}else return y=0,x=1,a;}
template<typename T>T power(T base,T index,T mod)
{
    T ans=1%mod;
    while(index)
    {
        if(index&1)ans=ans*base%mod;
        base=base*base%mod,index>>=1;
    }
    return ans;
}
const uint Block=250,Lim=400000;
uint Siz[Lim+5],Heavy[Lim+5],Fath[Lim+5],Rot[Lim+5],Dep[Lim+5],Dfn[Lim+5],Back[Lim+5],n,tp;
std::vector<std::pair<llt,uint> >W[Lim/Block+5];
std::vector<uint>Way[Lim+5],Del[Lim+5];
llt Val[Lim+5],Tag[Lim/Block+5];
voi dfs1(uint p,uint f){
    Fath[p]=f,Heavy[p]=-1,Siz[p]=1;
    for(auto s:Way[p])if(s!=f){
        Dep[s]=Dep[p]+1,dfs1(s,p),Siz[p]+=Siz[s];
        if(!~Heavy[p]||Siz[s]>Siz[Heavy[p]])Heavy[p]=s;
    }
}
voi dfs2(uint p,uint r){
    Back[Dfn[p]=tp++]=p,Rot[p]=r;if(~Heavy[p])dfs2(Heavy[p],r);
    for(auto s:Way[p])if(s!=Fath[p]&&s!=Heavy[p])dfs2(s,s);
}
voi rebuild(){
    if(n&&tp-n<300)return;
    for(uint i=0;i<=n/Block;i++)for(auto s:W[i])Val[Back[s.second]]=s.first+Tag[i];
    for(uint i=0;i<n;i++)if(Del[i].size()){
        std::vector<uint>V;
        std::sort(Del[i].begin(),Del[i].end());
        for(auto s:Way[i]){
            auto t=std::lower_bound(Del[i].begin(),Del[i].end(),s);
            if(t==Del[i].end()||*t!=s)V.push_back(s);
        }
        Way[i]=V,Del[i].clear();
    }
    for(uint i=n;i<tp;i++)for(auto s:Way[i])if(s<n)Way[s].push_back(i);
    n=tp,tp=0,dfs1(0,-1),dfs2(0,0);
    for(uint i=0;i<=n/Block;i++){
        W[i].clear(),Tag[i]=0;
        for(uint j=i*Block;j<(i+1)*Block&&j<n;j++)W[i].push_back({Val[Back[j]],j});
        std::sort(W[i].begin(),W[i].end());
    }
}
voi add_dfn(uint l,uint r,llt w){
    if(l>=r)return;
    std::vector<std::pair<llt,uint> >A,B;
    if(l/Block==r/Block){
        for(auto s:W[l/Block])(s.second>=l&&s.second<r?A:B).push_back(s);
        for(auto&s:A)s.first+=w;
        std::merge(A.begin(),A.end(),B.begin(),B.end(),W[l/Block].begin());
        return;
    }
    for(auto s:W[l/Block])(s.second>=l?A:B).push_back(s);
    for(auto&s:A)s.first+=w;
    std::merge(A.begin(),A.end(),B.begin(),B.end(),W[l/Block].begin());
    A.clear(),B.clear();
    for(auto s:W[r/Block])(s.second<r?A:B).push_back(s);
    for(auto&s:A)s.first+=w;
    std::merge(A.begin(),A.end(),B.begin(),B.end(),W[r/Block].begin());
    for(uint i=l/Block+1;i<r/Block;i++)Tag[i]+=w;
}
uint query_dfn(uint l,uint r,llt w){
    if(l>=r)return 0;
    uint ans=0;
    if(l/Block==r/Block){
        for(auto s:W[l/Block])if(s.second>=l&&s.second<r)ans+=s.first+Tag[l/Block]>=w;
        return ans;
    }
    for(auto s:W[l/Block])if(s.second>=l)ans+=s.first+Tag[l/Block]>=w;
    for(auto s:W[r/Block])if(s.second<r)ans+=s.first+Tag[r/Block]>=w;
    for(uint i=l/Block+1;i<r/Block;i++)if(W[i].size()){
        if(W[i][0].first+Tag[i]>=w)ans+=W[i].size();
        else if(W[i].back().first+Tag[i]>=w){
            uint l=0,r=W[i].size(),mid;
            while(l<r)if(W[i][mid=(l+r)>>1].first+Tag[i]>=w)r=mid;else l=mid+1;
            ans+=W[i].size()-l;
        }
    }
    return ans;
}
bol OnWay(uint u,uint v,uint p){
    while(Rot[u]!=Rot[v]){
        if(Dep[Rot[u]]<Dep[Rot[v]])std::swap(u,v);
        if(Dfn[p]>=Dfn[Rot[u]]&&Dfn[p]<=Dfn[u])return 1;
        u=Fath[Rot[u]];
    }
    if(Dep[u]>Dep[v])std::swap(u,v);
    return Dfn[p]>=Dfn[u]&&Dfn[p]<=Dfn[v];
}
voi add_line(uint u,uint v,llt w){
    while(Rot[u]!=Rot[v]){
        if(Dep[Rot[u]]<Dep[Rot[v]])std::swap(u,v);
        add_dfn(Dfn[Rot[u]],Dfn[u]+1,w),u=Fath[Rot[u]];
    }
    if(Dep[u]>Dep[v])std::swap(u,v);
    add_dfn(Dfn[u],Dfn[v]+1,w);
}
uint query_line(uint u,uint v,llt w){
    uint ans=0;
    while(Rot[u]!=Rot[v]){
        if(Dep[Rot[u]]<Dep[Rot[v]])std::swap(u,v);
        ans+=query_dfn(Dfn[Rot[u]],Dfn[u]+1,w),u=Fath[Rot[u]];
    }
    if(Dep[u]>Dep[v])std::swap(u,v);
    ans+=query_dfn(Dfn[u],Dfn[v]+1,w);
    return ans;
}
std::vector<uint>V;
bol dfs(uint p,uint f,uint t){
    V.push_back(p);
    if(p==t)return 1;
    for(auto s:Way[p])if(s>=n&&s!=f&&dfs(s,p,t))return 1;
    V.pop_back();
    return 0;
}
voi add(uint u,uint v,llt w){
    static bol Gone[Lim+5];for(uint i=n;i<tp;i++)Gone[i]=0;
    if(u>=n&&v<n)std::swap(u,v);
    if(v>=n){
        if(u<n){
            std::vector<std::pair<uint,uint> >P;
            V={v};Gone[v]=1;
            uint t=0;
            while(t<V.size()){
                uint p=V[t++];
                for(auto s:Way[p])if(s<n)P.push_back({p,s});else if(!Gone[s])Gone[s]=1,V.push_back(s);
            }
            bol op=P.size()==1?0:OnWay(u,P[0].second,P[1].second);
            V.clear(),dfs(P[op].first,-1u,v),v=P[op].second;
            for(auto s:V)Val[s]+=w;
        }
        else{
            std::vector<std::pair<uint,uint> >P1,P2;
            V={u};Gone[u]=1;
            uint t=0;
            while(t<V.size()){
                uint p=V[t++];
                for(auto s:Way[p])if(s<n)P1.push_back({p,s});else if(!Gone[s])Gone[s]=1,V.push_back(s);
            }
            if(Gone[v]){
                V.clear(),dfs(u,-1,v);for(auto s:V)Val[s]+=w;
                return;
            }
            V={v};Gone[v]=1;
            t=0;
            while(t<V.size()){
                uint p=V[t++];
                for(auto s:Way[p])if(s<n)P2.push_back({p,s});else if(!Gone[s])Gone[s]=1,V.push_back(s);
            }
            bol op1=P1.size()==1?0:OnWay(P2[0].second,P1[0].second,P1[1].second);
            bol op2=P2.size()==1?0:OnWay(P2[0].second,P1[0].second,P2[1].second);
            V.clear();
            dfs(P1[op1].first,-1u,u),u=P1[op1].second,dfs(P2[op2].first,-1u,v),v=P2[op2].second;
            for(auto s:V)Val[s]+=w;
        }
    }
    add_line(u,v,w);
    for(uint i=n;i<tp;i++)if(!Gone[i]){
        std::vector<std::pair<uint,uint> >P;
        V={i};Gone[i]=1;
        uint t=0;
        while(t<V.size()){
            uint p=V[t++];
            for(auto s:Way[p])if(s<n)P.push_back({p,s});else if(!Gone[s])Gone[s]=1,V.push_back(s);
        }
        if(P.size()==2&&OnWay(u,v,P[0].second)&&OnWay(u,v,P[1].second)){
            V.clear(),dfs(P[0].first,-1u,P[1].first);for(auto s:V)Val[s]+=w;
        }
    }
}
uint query(uint u,uint v,llt w){
    uint ans=0;
    static bol Gone[Lim+5];for(uint i=n;i<tp;i++)Gone[i]=0;
    if(u>=n&&v<n)std::swap(u,v);
    if(v>=n){
        if(u<n){
            std::vector<std::pair<uint,uint> >P;
            V={v};Gone[v]=1;
            uint t=0;
            while(t<V.size()){
                uint p=V[t++];
                for(auto s:Way[p])if(s<n)P.push_back({p,s});else if(!Gone[s])Gone[s]=1,V.push_back(s);
            }
            bol op=P.size()==1?0:OnWay(u,P[0].second,P[1].second);
            V.clear();
            dfs(P[op].first,-1u,v);
            for(auto s:V)ans+=Val[s]>=w;
            v=P[op].second;
        }
        else{
            std::vector<std::pair<uint,uint> >P1,P2;
            V={u};Gone[u]=1;
            uint t=0;
            while(t<V.size()){
                uint p=V[t++];
                for(auto s:Way[p])if(s<n)P1.push_back({p,s});else if(!Gone[s])Gone[s]=1,V.push_back(s);
            }
            if(Gone[v]){
                V.clear(),dfs(u,-1,v);
                for(auto s:V)ans+=Val[s]>=w;
                return ans;
            }
            V={v};Gone[v]=1;
            t=0;
            while(t<V.size()){
                uint p=V[t++];
                for(auto s:Way[p])if(s<n)P2.push_back({p,s});else if(!Gone[s])Gone[s]=1,V.push_back(s);
            }
            bol op1=P1.size()==1?0:OnWay(P2[0].second,P1[0].second,P1[1].second);
            bol op2=P2.size()==1?0:OnWay(P2[0].second,P1[0].second,P2[1].second);
            V.clear();
            dfs(P1[op1].first,-1u,u),u=P1[op1].second,dfs(P2[op2].first,-1u,v),v=P2[op2].second;
            for(auto s:V)ans+=Val[s]>=w;
        }
    }
    ans+=query_line(u,v,w);
    for(uint i=n;i<tp;i++)if(!Gone[i]){
        std::vector<std::pair<uint,uint> >P;
        V={i};Gone[i]=1;
        uint t=0;
        while(t<V.size()){
            uint p=V[t++];
            for(auto s:Way[p])if(s<n)P.push_back({p,s});else if(!Gone[s])Gone[s]=1,V.push_back(s);
        }
        if(P.size()==2&&OnWay(u,v,P[0].second)&&OnWay(u,v,P[1].second)){
            V.clear(),dfs(P[0].first,-1u,P[1].first);
            for(auto s:V)ans+=Val[s]>=w;
        }
    }
    return ans;
}
int main()
{
#ifdef MYEE
    freopen("QAQ.in","r",stdin);
    freopen("QAQ.out","w",stdout);
#endif
    uint q,ans=0;scanf("%u%u",&tp,&q);
    for(uint i=0;i<tp;i++)scanf("%lld",Val+i);
    for(uint i=1,u,v;i<tp;i++)
        scanf("%u%u",&u,&v),Way[--u].push_back(--v),Way[v].push_back(u);
    while(q--){
        rebuild();
        uint op,u,v;int w;
        scanf("%u%u",&op,&u),u=(u^ans)-1;
        if(op==1){
            scanf("%u%d",&v,&w),v=(v^ans)-1,w^=ans,Val[tp]=w;
            if(u>=n&&v<n)std::swap(u,v);
            if(u<n&&v<n)Del[u].push_back(v),Del[v].push_back(u);
            else if(u<n){for(auto&s:Way[v])if(s==u)s=tp;}
            else{
                for(auto&s:Way[v])if(s==u)s=tp;
                for(auto&s:Way[u])if(s==v)s=tp;
            }
            Way[tp++]={u,v};
        }else if(op==2){
            scanf("%d",&w),w^=ans,Val[tp]=w;
            if(u>=n)Way[u].push_back(tp);
            Way[tp++].push_back(u);
        }else if(op==3){
            scanf("%u%d",&v,&w),v=(v^ans)-1,w^=ans,add(u,v,w);
        }else{
            scanf("%u%d",&v,&w),v=(v^ans)-1,w^=ans;
            printf("%u\n",ans=query(u,v,w));
        }
    }
    return 0;
}

// 那就是希望。
// 即便需要取模，也是光明。