#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<map>
#include<set>
#include<queue>
#include<vector>
#define ll __int128
#define Mpr(x,y) make_pair(x,y)
#define PR pair<int,int>
#define fi first
#define se second
using namespace std;
const long long N=2e5+5,M=30,md=998244353,F=1e9;
long long n,q,u,v,cnt,tot,fa[N][M],dep[N],in[N],out[N],opt,a[N],all,sum,els,m,p1,p0;
vector<ll>c[N],g[N];
struct TreeB { ll ls,rs,c0,c1,c2; }T[N*30];
#define ls(x) T[x].ls
#define rs(x) T[x].rs
#define c0(x) T[x].c0
#define c1(x) T[x].c1
#define c2(x) T[x].c2
#define mid (l+r)/2
void up(ll x) { ll ls=ls(x),rs=rs(x); c0(x)=c0(ls)+c0(rs); c1(x)=c1(ls)+c1(rs); c2(x)=c2(ls)+c2(rs);  }
void add(ll &x,ll l,ll r,ll pos,ll k)
{
	if (!x) x=++cnt;
	if (l==r) return c0(x)+=k,c1(x)+=pos*k,c2(x)+=pos*pos*k,void();
	if (pos<=mid) add(ls(x),l,mid,pos,k); else add(rs(x),mid+1,r,pos,k); up(x);
}
#undef mid
struct TreeA { ll l,r,rt; }tt[N*4];
#define l(x) tt[x].l
#define r(x) tt[x].r
#define rt(x) tt[x].rt
void build(ll x,ll l,ll r)
{
	tt[x]={l,r,++cnt};
	if (l==r) return ;
	ll mid=(l+r)/2;
	build(x*2,l,mid); build(x*2+1,mid+1,r);
}
void ins(ll x,ll l,ll r,ll v,ll k)
{
	if (l(x)>r||r(x)<l) return ;
	if (l<=l(x)&&r(x)<=r) return add(rt(x),0,F,v,k),void();
	ins(x*2,l,r,v,k); ins(x*2+1,l,r,v,k);
}
void dfs(ll x,ll ft)
{
	fa[x][0]=ft; in[x]=++tot; dep[x]=dep[ft]+1;
	for (ll i=1;i<=20;i++) fa[x][i]=fa[fa[x][i-1]][i-1];
	for (auto t:c[x]) if (t!=ft) dfs(t,x); out[x]=tot;
}
ll Lca(ll x,ll y)
{
	if (dep[x]<dep[y]) swap(x,y);
	for (ll i=20;i>=0;i--) if (dep[fa[x][i]]>=dep[y]) x=fa[x][i];
	if (x==y) return x;
	for (ll i=20;i>=0;i--) if (fa[x][i]!=fa[y][i]) x=fa[x][i],y=fa[y][i];
	return fa[x][0];
}
void Get(ll x,ll pos,ll k)
{
	if (pos<l(x)||pos>r(x)) return ;
	g[k].push_back(rt(x)); els+=k>1?-c2(rt(x)):c2(rt(x));
	if (l(x)==r(x)) return ; 
	if (pos<=r(x*2)) Get(x*2,pos,k); else Get(x*2+1,pos,k);
}
void solve(ll l,ll r)
{
	if (l==r)
	{
		ll num=p0;
		for (auto t:g[1]) num+=c0(t); 
		for (auto t:g[2]) num-=c0(t);
//		cout<<l<<" "<<r<<" "<<m<<" "<<num<<" "<<m-p1+p0*l<<" "<<all<<" "<<els<<" "<<all-els<<" "<<p0<<" "<<p1<<endl;
		m=min(num,m-p1+p0*l); 
		if (!l) sum+=(num-m)*l*l; else 
		sum+=(num-m)*l*l+m*(l-1)*(l-1);
		return ;
	}
	ll mid=(l+r)/2;
	ll s0=p0,s1=p1,h=0;
	for (auto t:g[1]) 
		s0+=c0(rs(t)),s1+=c1(rs(t)),h+=c2(ls(t));
	for (auto t:g[2]) 
		s0-=c0(rs(t)),s1-=c1(rs(t)),h-=c2(ls(t));
//	cout<<l<<" "<<r<<" "<<mid<<" "<<s0<<" "<<s1<<" "<<s1-s0*mid<<endl;
	if (s1-s0*mid<m) 
	{
		for (auto &t:g[1]) t=ls(t);  
		for (auto &t:g[2]) t=ls(t);
		p0=s0; p1=s1; solve(l,mid);
	} else 
	{
		for (auto &t:g[1]) t=rs(t);
		for (auto &t:g[2]) t=rs(t);
		sum+=h; solve(mid+1,r);
	}
}
int main()
{
	cin>>n>>q;
	for (ll i=1;i<n;i++) scanf("%lld%lld",&u,&v),c[u].push_back(v),c[v].push_back(u);
	dfs(1,0); build(1,1,n);
	for (ll i=1;i<=n;i++) 
		scanf("%lld",&a[i]),ins(1,in[i],out[i],a[i],1),all+=a[i]*a[i];
	while (q--)
	{
		scanf("%lld%lld%lld",&opt,&u,&v);
		if (opt==1) ins(1,in[u],out[u],a[u],-1),all+=v*v-a[u]*a[u],a[u]=v,ins(1,in[u],out[u],a[u],1);
		else 
		{
			scanf("%lld",&m); sum=els=p1=p0=0;
			ll lca=Lca(u,v); for (ll i=1;i<=2;i++) g[i].clear();
			Get(1,in[u],1); 
			Get(1,in[v],1); 
			Get(1,in[lca],2); 
			Get(1,in[fa[lca][0]],2);
//			for (auto t:g[1]) cout<<t<<" "; cout<<endl;
//			for (auto t:g[2]) cout<<t<<" "; cout<<endl; 
			solve(0,F); printf("%lld\n",all-els+sum);
		}
	}
	return 0;
}