#include<bits/stdc++.h>
#define ll long long
#define i128 __int128
using namespace std;
struct edge{int v,nxt;}e[200005];
int cnt,h[100005],dep[100005],f[100005][20],dfn[100005],dfx,siz[100005]; 
int n,c[200005],a[100005],pos[100005],id[100005],tot,bl[200005],L[1005],R[1005];
int val0[505][505],num[505][100005],m,u,v;
ll val1[505][505];i128 val2[505][505];mt19937 rnd(19260817);
struct node{int op,x,y;ll z;}q[100005];
void add(int u,int v){e[++cnt]={v,h[u]};h[u]=cnt;}
void dfs(int u,int fa)
{
	dep[u]=dep[fa]+1;f[u][0]=fa;dfn[u]=++dfx;siz[u]=1;
	for(int i=1;(1<<i)<=n;i++)f[u][i]=f[f[u][i-1]][i-1];
	for(int i=h[u];i;i=e[i].nxt)
	{
		int v=e[i].v;
		if(v==fa)continue;
		dfs(v,u);siz[u]+=siz[v];
	}
}
int lca(int u,int v)
{
	if(dep[u]<dep[v])swap(u,v);
	for(int i=16;i>=0;i--)if(dep[f[u][i]]>=dep[v])u=f[u][i];
	if(u==v)return u;
	for(int i=16;i>=0;i--)if(f[u][i]!=f[v][i])u=f[u][i],v=f[v][i];
	return f[u][0];
}
int calc(int val,int x)
{
	if(c[a[x]]>=val)return c[a[x]]-val;
	else return 0;
}
ll solve(int val,int x)
{
	ll res=0;
	while(x&&!pos[x])
	{
		res+=calc(val,x);
		x=f[x][0];
	} 
	if(!x)return res;
	int p=upper_bound(c+1,c+tot+1,val)-c;
	for(int i=bl[p]+1;i<=bl[tot];i++)res+=val1[pos[x]][i]-1ll*val0[pos[x]][i]*val;
	for(int i=p;i<=R[bl[p]];i++)res+=1ll*num[pos[x]][i]*(c[i]-val);
	return res;
}
ll get(int val,int x)
{
	if(c[a[x]]>=val)return 1ll*val*val;
	else return 1ll*c[a[x]]*c[a[x]];
}
i128 getres(int val,int x)
{
	i128 res=0;
	while(x&&!pos[x])
	{
		res+=get(val,x);
		x=f[x][0];
	} 
	if(!x)return res;
	int p=upper_bound(c+1,c+tot+1,val)-c;
	for(int i=bl[p]+1;i<=bl[tot];i++)res+=(i128)val0[pos[x]][i]*val*val;
	for(int i=p;i<=R[bl[p]];i++)res+=(i128)num[pos[x]][i]*val*val;
	for(int i=L[bl[p]];i<p;i++)res+=(i128)num[pos[x]][i]*c[i]*c[i];
	for(int i=1;i<bl[p];i++)res+=val2[pos[x]][i];
	return res;
}
void write(i128 x)
{
	if(!x)return;
	write(x/10);
	cout<<char(x%10+'0');
}
int main()
{
	cin.tie(0)->sync_with_stdio(0);
	cin>>n>>m;
	for(int i=1;i<n;i++)
	{
		cin>>u>>v;
		add(u,v);add(v,u);
	}
	for(int i=1;i<=n;i++)cin>>a[i],c[++tot]=a[i];
	for(int i=1;i<=m;i++)
	{
		cin>>q[i].op;
		if(q[i].op==1)cin>>q[i].x>>q[i].y,c[++tot]=q[i].y;
		else cin>>q[i].x>>q[i].y>>q[i].z;
	}
	sort(c+1,c+tot+1);tot=unique(c+1,c+tot+1)-c-1;
	for(int i=1;i<=n;i++)a[i]=lower_bound(c+1,c+tot+1,a[i])-c;
	for(int i=1;i<=m;i++)if(q[i].op==1)q[i].y=lower_bound(c+1,c+tot+1,q[i].y)-c;
	for(int i=1;i<=n;i++)id[i]=i;
	shuffle(id+1,id+n+1,rnd);
	int B=sqrt(n),B2=sqrt(tot); 
	for(int i=1;i<=B;i++)pos[id[i]]=i;
	dfs(1,0);
	for(int i=1;i<=tot;i++)
	{
		bl[i]=(i-1)/B2+1;
		if(bl[i]!=bl[i-1])L[bl[i]]=i,R[bl[i-1]]=i-1;
	}
	R[bl[tot]]=tot;
	for(int i=1;i<=B;i++)
	{
		int x=id[i];
		while(x)
		{
			val0[i][bl[a[x]]]++;
			val1[i][bl[a[x]]]+=c[a[x]];
			val2[i][bl[a[x]]]+=1ll*c[a[x]]*c[a[x]];
			num[i][a[x]]++;x=f[x][0];
		}
	}
	for(int i=1;i<=m;i++)
	{
		if(q[i].op==1)
		{
			int x=q[i].x,w=q[i].y;
			for(int j=1;j<=B;j++)
			{
				if(dfn[x]<=dfn[id[j]]&&dfn[id[j]]<=dfn[x]+siz[x]-1)
				{
					val0[j][bl[a[x]]]--;
					val1[j][bl[a[x]]]-=c[a[x]];
					val2[j][bl[a[x]]]-=1ll*c[a[x]]*c[a[x]];
					num[j][a[x]]--;
					val0[j][bl[w]]++;
					val1[j][bl[w]]+=c[w];
					val2[j][bl[w]]+=1ll*c[w]*c[w];
					num[j][w]++;
				}
			}
			a[q[i].x]=q[i].y;
		}
		else 
		{
			int u=q[i].x,v=q[i].y,Lca=lca(u,v);
			int l=0,r=c[tot],pos=0;
			while(l<=r)
			{
				int mid=(l+r)>>1;
				if(solve(mid,u)+solve(mid,v)-2*solve(mid,Lca)+calc(mid,Lca)<=q[i].z)r=mid-1,pos=mid;
				else l=mid+1;
			}
			if(pos==0){cout<<0<<'\n';continue;}
			ll now=solve(pos,u)+solve(pos,v)-2*solve(pos,Lca)+calc(pos,Lca);
			i128 res=getres(pos,u)+getres(pos,v)-2*getres(pos,Lca)+get(pos,Lca);
			res-=(i128)(q[i].z-now)*(2*pos-1);
			if(!res)cout<<0<<'\n';
			else write(res),cout<<'\n';
		}
	}
	return 0;
}