#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll __int128
const int N=1e5+5;
struct msg{
    signed sm;
    int rs;
    ll pf;
    friend msg operator+(msg a,msg b){
        return {a.sm+b.sm,a.rs+b.rs,a.pf+b.pf};
    }
    friend msg operator-(msg a,msg b){
        return {a.sm-b.sm,a.rs-b.rs,a.pf-b.pf};
    }
}emp;
namespace trr{
    struct node{
        signed lson,rson;
        msg sm;
    }p[N*300];
    int bk[300*N],idx;
    int nw(){
        return bk[idx--];
    }
    void init(int x,int op){
        if(!p[x].lson&&op==0)p[x].lson=nw();
        if(!p[x].rson&&op==1)p[x].rson=nw();
    }
    void add(int x,int l,int r,msg sm,int nl=1,int nr=1e5){
        if(l<=nl&&r>=nr){
       //     cout<<"add"<<x<<" "<<nl<<" "<<nr<<" "<<sm.sm<<endl;
            p[x].sm=p[x].sm+sm;
            return;
        }
        int mid=nl+nr>>1;
        if(l<=mid)init(x,0);
        if(r>mid)init(x,1);
        if(l<=mid)add(p[x].lson,l,r,sm,nl,mid);
        if(r>mid)add(p[x].rson,l,r,sm,mid+1,nr);
        if(p[p[x].lson].sm.sm==0)bk[++idx]=p[x].lson,p[x].lson=0;
        if(p[p[x].rson].sm.sm==0)bk[++idx]=p[x].rson,p[x].rson=0;
    }
    msg gets(int x,int d,int nl=1,int nr=1e5){
        if(!d)return emp;
        if(!x)return emp;
     //   cout<<nl<<" "<<nr<<" "<<d<<" "<<p[x].sm.sm<<endl;
        if(nl==nr)return p[x].sm;
        int mid=nl+nr>>1;
        if(d<=mid)return gets(p[x].lson,d,nl,mid)+p[x].sm;
        else return gets(p[x].rson,d,mid+1,nr)+p[x].sm;
    }
}
namespace tr{
    struct node{
        int lson,rson,rt;
    }p[50*N];
    int idx;
    void init(int x){
        if(!p[x].lson)p[x].lson=++idx,p[idx].rt=trr::nw();
        if(!p[x].rson)p[x].rson=++idx,p[idx].rt=trr::nw();
    }
    void add(int x,int d,int l,int r,int sm,int nl=0,int nr=1e9){
        trr::add(p[x].rt,l,r,{sm,sm*d,sm*d*d});
      //  cout<<x<<" "<<nl<<"-"<<nr<<" "<<p[x].rt<<" "<<p[x].lson<<endl;
        if(nl==nr)return;
        int mid=nl+nr>>1;
        init(x);
        if(d<=mid)add(p[x].lson,d,l,r,sm,nl,mid);
        else add(p[x].rson,d,l,r,sm,mid+1,nr);
    }
    msg gets(int x,int l,int r,int d,int nl=0,int nr=1e9){
        if(!x||!d)return emp;
       // cout<<"ok"<<endl;
        if(l<=nl&&r>=nr)return trr::gets(p[x].rt,d);
        int mid=nl+nr>>1;
        if(r<=mid)return gets(p[x].lson,l,r,d,nl,mid);
        if(l>mid)return gets(p[x].rson,l,r,d,mid+1,nr);
        return gets(p[x].lson,l,r,d,nl,mid)+gets(p[x].rson,l,r,d,mid+1,nr);
    }
    int solve(int x,int x1,int x2,int x3,int x4,int k,int he,int sz,int nl=0,int nr=1e9){
        if(nl==nr)return nl;
        int mid=nl+nr>>1;
        msg c=trr::gets(p[p[x].rson].rt,x1)+trr::gets(p[p[x].rson].rt,x2)-trr::gets(p[p[x].rson].rt,x3)-trr::gets(p[p[x].rson].rt,x4);
        int ans=c.rs+he-mid*(c.sm+sz);
       // cout<<nl<<" "<<nr<<" "<<mid<<" "<<c.sm<<" "<<c.rs<<" "<<ans<<" "<<trr::gets(p[p[x].rson].rt,x2).rs<<endl;
        if(ans<=k)return solve(p[x].lson,x1,x2,x3,x4,k,he+c.rs,sz+c.sm,nl,mid);
        return solve(p[x].rson,x1,x2,x3,x4,k,he,sz,mid+1,nr);
    }
}
int n,m,w[N],fa[N],dep[N],mk[N],dfn[N],eds[N],idx,fs[N][20];
ll al;
vector<int>p[N];
void dfs(int x){
    mk[x]=1;dfn[x]=++idx;
    for(int i=1;i<=18;i++)fs[x][i]=fs[fs[x][i-1]][i-1];
    for(auto c:p[x]){
        if(mk[c])continue;
        dep[c]=dep[x]+1;
        fs[c][0]=x;
        dfs(c);
        fa[c]=x;
    }
    mk[x]=0;eds[x]=idx;
}
int up(int x,int k){
    while(k){
        x=fs[x][__lg(k&-k)];
        k^=k&-k;
    }
    return x;
}
int lca(int a,int b){
    if(dep[a]>dep[b])swap(a,b);
    b=up(b,dep[b]-dep[a]);
    if(a==b)return a;
    for(int i=18;i>=0;i--){
        if(fs[a][i]!=fs[b][i])a=fs[a][i],b=fs[b][i];
    }
    return fs[a][0];
}
msg gets(int x,int l=0,int r=1e9){
    return tr::gets(1,l,r,dfn[x]);
}
void print(ll x){
    if(x>9)print(x/10);
    putchar(x%10+'0');
}
signed main(){
    //fin();fout();
    cin>>n>>m;
    for(int i=1;i<300*N;i++)trr::bk[++trr::idx]=i;
    for(int i=1;i<n;i++){
        int x,y;
        cin>>x>>y;
        p[x].push_back(y);
        p[y].push_back(x);
    }
    tr::idx=1;
    tr::p[1].rt=trr::nw();
    dfs(1);
    for(int i=1;i<=n;i++)cin>>w[i],tr::add(1,w[i],dfn[i],eds[i],1),al+=w[i]*w[i];
    while(m--){
        int op,x,y,k;
        cin>>op>>x>>y;
        if(op==1){
            tr::add(1,w[x],dfn[x],eds[x],-1);
            al-=w[x]*w[x];
            w[x]=y;
            al+=y*y;
            tr::add(1,y,dfn[x],eds[x],1);
        }else{
            cin>>k;
            int z=lca(x,y);
            ll res=0,ans=0;
            msg cc=gets(x)+gets(y)-gets(z)-gets(fa[z]);
            res=al-cc.pf;
        //    cout<<cc.sm<<" "<<cc.rs<<" "<<x<<" "<<y<<" "<<z<<endl;
            if(cc.rs<=k){
                print(res);
                puts("");
                continue;
            }
            int t=tr::solve(1,dfn[x],dfn[y],dfn[z],dfn[fa[z]],k,0,0);
            cc=gets(x,0,t)+gets(y,0,t)-gets(z,0,t)-gets(fa[z],0,t);
            res+=cc.pf;
            cc=gets(x,t+1,1e9)+gets(y,t+1,1e9)-gets(z,t+1,1e9)-gets(fa[z],t+1,1e9);
            ans=cc.rs-t*cc.sm;res+=(ll)t*t*cc.sm;
            res-=(k-ans)*(2*t-1);
            print(res);
            puts("");
        }
    }
}