#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
typedef __int128 lll;
int n,q;
struct node
{
    int c;long long v;lll v2;inline bool any()const{return c||v;}
    node operator+(const node&s)const{return {c+s.c,v+s.v,v2+s.v2};}
    node operator-(const node&s)const{return {c-s.c,v-s.v,v2-s.v2};}
}tr[N];
void mdf(int k,const node&v){while(k<=n)tr[k]=tr[k]+v,k+=k&(-k);}
void mdf(int l,int r,int k){int sgn=k<0?-1:1;mdf(l,{sgn,k,1ll*sgn*k*k}),mdf(r+1,{-sgn,-k,-1ll*sgn*k*k});}
node ask(int k){node ans={0,0,0};while(k)ans=ans+tr[k],k-=k&(-k);return ans;}
struct mes{int t,x,k;}qx[N*4];
lll ans[N];
struct awa{int t,u,v,l,lc,rc;long long rm;}qy[N],t1[N];
vector<int>to[N];
int dfn[N],sz[N],DP[N],tx,ty,a[N],tt,fa[N],son[N],top[N];
void dfs(int u,int f)
{
    DP[u]=DP[fa[u]=f]+1;sz[u]=1;
    for(int v:to[u])if(v!=f)
    {
        dfs(v,u),sz[u]+=sz[v];
        if(sz[son[u]]<sz[v])son[u]=v;
    }
}
void dfs1(int u,int f)
{
    top[u]=f;dfn[u]=++tt;if(son[u])dfs1(son[u],f);
    for(int v:to[u])if(v!=fa[u]&&v!=son[u])dfs1(v,v);
}
int LCA(int u,int v)
{
    while(top[u]!=top[v])
    {
        if(DP[top[u]]<DP[top[v]])swap(u,v);
        u=fa[top[u]];
    }
    return DP[u]<DP[v]?u:v;
}
void solve(int l,int r,int lx,int rx,int ly,int ry)
{
    if(ly>ry)return;
    if(l==r)
    {
        for(int i=ly;i<=ry;++i)
        {
            auto&A=qy[i];
            int d=A.lc;
            ans[A.t]-=(lll)A.rm*(l+l-1);
        }
        return;
    }
    int mid=l+r>>1;
    int px=lx,py1=ly,py2=ry,px1=lx,px2=rx;
    sort(qx+lx,qx+rx+1,[&](const mes&A,const mes&B){return A.t<B.t;});
    sort(qy+ly,qy+ry+1,[&](const awa&A,const awa&B){return A.t<B.t;});
    for(int i=ly;i<=ry;++i)
    {
        while(px<=rx&&qx[px].t<=qy[i].t)
        {
            const auto&A=qx[px];
            if(abs(A.k)>mid)
            {
                int u=A.x;
                mdf(dfn[u],dfn[u]+sz[u]-1,A.k);
            }
            ++px;
        }
        auto&A=qy[i];
        node z= ask(dfn[A.u])+ask(dfn[A.v])-
                ask(dfn[A.l])-ask(dfn[fa[A.l]]);
        if(A.rm>=1ll*(r-mid)*A.rc+z.v-1ll*mid*z.c)
        {
            ans[A.t]-=(lll)(1ll*r*r-1ll*mid*mid)*A.rc+z.v2-(lll)z.c*mid*mid;
            A.rm-=1ll*(r-mid)*A.rc+z.v-1ll*mid*z.c;A.rc+=z.c;t1[py1++]=A;
        }
        else
        {
            A.lc=A.rc+z.c;
            t1[py2--]=A;
        }
    }
    for(int i=lx;i<px;++i)
    {
        const auto&A=qx[i];
        if(abs(A.k)>mid)
        {
            int u=A.x;
            mdf(dfn[u],dfn[u]+sz[u]-1,-A.k);
        }
    }
    sort(qx+lx,qx+rx+1,[&](const mes&A,const mes&B){return abs(A.k)<abs(B.k);});
    px1=lx;while(px1<=rx&&abs(qx[px1].k)<=mid)++px1;
    for(int i=ly;i<=ry;++i)qy[i]=t1[i];
    solve(l,mid,lx,px1-1,ly,py1-1);
    solve(mid+1,r,px1,rx,py1,ry);
}
void print(lll x)
{
    if(x>9)print(x/10);
    putchar(x%10+'0');
}
int main()
{
    freopen("PanzerSupply.in","r",stdin);
    freopen("PanzerSupply.out","w",stdout);
    cin.tie(0)->sync_with_stdio(0);
    cin>>n>>q;
    for(int i=1,u,v;i<n;++i)cin>>u>>v,to[u].push_back(v),to[v].push_back(u);
    for(int i=1;i<=n;++i)cin>>a[i],qx[++tx]={0,i,a[i]};dfs(1,0);dfs1(1,1);
    for(int i=1;i<=n;++i)mdf(dfn[i],dfn[i]+sz[i]-1,qx[i].k);
    memset(ans,-1,sizeof ans);
    int mx=0;
    lll S=0;
    for(int i=1;i<=n;++i)S+=1ll*a[i]*a[i];
    for(int i=1;i<=q;++i)
    {
        int o,u,v,x;
        long long m;
        cin>>o;
        if(o==1)
        {
            cin>>u>>x;mx=max({mx,a[i],x});
            qx[++tx]={i,u,-a[u]};
            S-=1ll*a[u]*a[u];
            mdf(dfn[u],dfn[u]+sz[u]-1,qx[tx].k);
            qx[++tx]={i,u,x};
            S+=1ll*x*x;
            mdf(dfn[u],dfn[u]+sz[u]-1,qx[tx].k);
            a[u]=x;
        }
        else
        {
            cin>>u>>v>>m;int l=LCA(u,v);
            auto z= ask(dfn[u])+ask(dfn[v])-
                    ask(dfn[l])-ask(dfn[fa[l]]);
            m=min(m,z.v);ans[i]=S;
            qy[++ty]={i,u,v,l,z.c,0,m};
        }
    }
    memset(tr,0,sizeof tr);
    solve(0,mx,1,tx,1,ty);
    for(int i=1;i<=q;++i)if(ans[i]!=-1)print(ans[i]),putchar('\n');
    return 0;
}