#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e5+5;
int n,m,w[N],fa[N],dep[N],res,lth,mk[N];
vector<int>p[N];
void dfs(int x){
    mk[x]=1;
    for(auto c:p[x]){
        if(mk[c])continue;
        dfs(c);
        fa[c]=x;
    }
    mk[x]=0;
}
int solve(int a,int b){
    lth=0;res=0;
    memset(mk,0,sizeof(mk));
    if(dep[a]>dep[b])swap(a,b);
    while(dep[b]>dep[a])res+=w[b],mk[b]=1,b=fa[b],lth++;
    while(a!=b)res+=w[a]+w[b],mk[a]=mk[b]=1,a=fa[a],b=fa[b],lth+=2;
    res+=w[a];mk[a]=1;lth++;
    return res;
}
signed main(){
    cin>>n>>m;
    for(int i=1;i<n;i++){
        int x,y;
        cin>>x>>y;
        p[x].push_back(y);
        p[y].push_back(x);
    }
    dfs(1);
    for(int i=1;i<=n;i++)cin>>w[i];
    while(m--){
        int op,x,y,k;
        cin>>op>>x>>y;
        if(op==1){
            w[x]=y;
        }else{
            cin>>k;
            int res=solve(x,y),ans=0;
            for(int i=1;i<=n;i++)if(!mk[i])ans+=w[i]*w[i];
            if(k<res){
                k=res-k;
                int t=k/lth,ts=k-t*lth;
                ans+=t*t*(lth-ts)+(t+1)*(t+1)*ts;
            }
            cout<<ans<<endl;
        }
    }
}