#include <bits/stdc++.h>
using namespace std;
#define For(Ti,Ta,Tb) for(auto Ti=(Ta);Ti<=(Tb);++Ti)
#define Dec(Ti,Ta,Tb) for(auto Ti=(Ta);Ti>=(Tb);--Ti)
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define range(Tx) begin(Tx),end(Tx)
using ll=long long;
using i128=__int128;
ostream& operator<<(ostream& os,i128 x){
	if(x>=10) os<<x/10;
	return os<<int(x%10);
}
const int N=1e5+5,LogN=18,V=1e9;
int n,q,a[N],fa[N],dfn[N],dfx,siz[N],dep[N],anc[N][LogN];
vector<int> e[N];
void dfs(int u){
	dfn[u]=++dfx;
	siz[u]=1;
	dep[u]=dep[fa[u]]+1;
	anc[u][0]=fa[u];
	For(j,1,LogN-1){
		anc[u][j]=anc[anc[u][j-1]][j-1];
	}
	for(int v:e[u]){
		if(v!=fa[u]){
			fa[v]=u;
			dfs(v);
			siz[u]+=siz[v];
		}
	}
}
int lca(int u,int v){
	if(dep[u]<dep[v]) swap(u,v);
	for(int x=dep[u]-dep[v],i=0;x;x>>=1,++i){
		if(x&1) u=anc[u][i];
	}
	if(u==v) return u;
	Dec(i,LogN-1,0){
		if(anc[u][i]!=anc[v][i]){
			u=anc[u][i];
			v=anc[v][i];
		}
	}
	return anc[u][0];
}
struct Func{
	ll a,b;
	i128 c;
	Func operator+=(const Func& f){
		a+=f.a;
		b+=f.b;
		c+=f.c;
		return *this;
	}
	Func operator-() const{
		return {-a,-b,-c};
	}
	Func operator+(const Func& f) const{
		return Func(*this)+=f;
	}
	Func operator-(const Func& f) const{
		return Func(*this)+=-f;
	}
};
struct BIT{
	Func t[N];
	vector<int> pos;
	void add(int p,Func x){
		pos.push_back(p);
		for(;p<=n;p+=p&-p) t[p]+=x;
	}
	void range_add(int l,int r,Func x){
		add(l,x);
		add(r+1,-x);
	}
	Func query(int p){
		Func res{};
		for(;p;p&=p-1) res+=t[p];
		return res;
	}
	Func chain_query(int u,int v,int lca){
		return query(dfn[u])+query(dfn[v])-query(dfn[lca])-query(dfn[fa[lca]]);
	}
	void clear(){
		for(int p:pos){
			for(;p<=n;p+=p&-p) t[p]={};
		}
		pos.clear();
	}
}bit;
struct Oper{
	int tp,u,v;
	ll x,y;
}op[N*2];
int plca[N*2];
ll val[N*2];
Func sum[N*2];
void solve(ll l,ll r,const vector<int>& ops){
	if(l>r||!ops.size()) return;
	ll mid=(l+r)/2;
	bit.clear();
	vector<int> lops,rops;
	for(int i:ops){
		auto [tp,u,v,x,y]=op[i];
		if(tp==1){
			if(mid<=y&&y<=r){
				bit.range_add(dfn[u],dfn[u]+siz[u]-1,{-1,-y,-y*y});
			}
			if(mid<=x&&x<=r){
				bit.range_add(dfn[u],dfn[u]+siz[u]-1,{1,x,x*x});
			}
			if((l<=x&&x<mid)||(l<=y&&y<mid)){
				lops.push_back(i);
			}
			if((mid<x&&x<=r)||(mid<y&&y<=r)){
				rops.push_back(i);
			}
		}else{
			Func f=bit.chain_query(u,v,plca[i]);
			if(sum[i].b+f.b-(f.a+sum[i].a)*mid<=x){
				val[i]=mid;
				sum[i]+=f;
				lops.push_back(i);
			}else{
				rops.push_back(i);
			}
		}
	}
	solve(l,mid-1,lops);
	solve(mid+1,r,rops);
}
i128 ans[N*2];
int main(){
	cin.tie(nullptr)->sync_with_stdio(false);
	cin>>n>>q;
	For(i,1,n-1){
		int u,v;
		cin>>u>>v;
		e[u].push_back(v);
		e[v].push_back(u);
	}
	For(i,1,n) cin>>a[i];
	dfs(1);
	For(i,1,n){
		op[i]={1,i,0,a[i],ll(1e18)};
	}
	i128 sum2=0;
	For(i,1,n) sum2+=1LL*a[i]*a[i];
	For(i,n+1,n+q){
		cin>>op[i].tp>>op[i].u;
		if(op[i].tp==1){
			cin>>op[i].x;
			op[i].y=a[op[i].u];
			sum2-=op[i].y*op[i].y;
			a[op[i].u]=op[i].x;
			sum2+=op[i].x*op[i].x;
		}else{
			cin>>op[i].v>>op[i].x;
			plca[i]=lca(op[i].u,op[i].v);
			ans[i]=sum2;
		}
	}
	vector<int> ops(n+q);
	iota(range(ops),1);
	solve(0,V,ops);
	For(i,1,n+q){
		if(op[i].tp==2){
			if(!val[i]){
				cout<<ans[i]-sum[i].c<<'\n';
				continue;
			}
			ll left=op[i].x-(sum[i].b-val[i]*sum[i].a);
			cout<<ans[i]-sum[i].c+i128(val[i])*val[i]*(sum[i].a-left)+i128(val[i]-1)*(val[i]-1)*left<<'\n';
		}
	}
	return 0;
}