#include <bits/stdc++.h>
#define int long long
using namespace std;
const int _=1e5+7;
int s[_],top,n,q,val[_],op,u,b,v,m,sum,fl;
vector<int>g[_];
void dfs(int x,int fa,int t){
	s[++top]=x;
	if(t==x){fl=1;return;}
	for(int v:g[x]){
		if(v==fa)continue;
		dfs(v,x,t);if(fl)return;
	}top--;
}
signed main(){
	scanf("%lld%lld",&n,&q);
	for(int i=1,u,v;i<n;i++)
		scanf("%lld%lld",&u,&v),g[u].push_back(v),g[v].push_back(u);
	for(int i=1;i<=n;i++)
		scanf("%lld",&val[i]),sum+=val[i]*val[i];
	while(q--){
		scanf("%lld",&op);
		if(op==1)
			scanf("%lld%lld",&u,&b),sum-=val[u]*val[u]-b*b,val[u]=b;
		else {
			scanf("%lld%lld%lld",&u,&v,&m);
			fl=0;top=0;dfs(u,0,v);
			int ans=sum,S=0;
			for(int i=1;i<=top;i++)
				S+=val[s[i]]*val[s[i]];
			ans-=S;
			int l=0,r=m;
			while(l<r){
				int mid=(l+r)>>1;
				int ss=0;
				for(int i=1;i<=top;i++)
					if(val[s[i]]>mid)ss+=val[s[i]]-mid;
				if(ss>m)l=mid+1;
				else r=mid;
			}
			for(int i=1;i<=top;i++)
				ans+=min(val[s[i]],l)*min(val[s[i]],l);
			printf("%lld\n",ans);
		}
	}
	return 0;
}