//这回只花了114514min就打完了。
//真好。记得多手造几组。
#include <bits/stdc++.h>
#define int long long
#define pai 3.141592653589793238462643383279502884197169399375105820
#define MOD 1000000007
#define eps 0.00000001
inline int min(int a,int b) {return a<b?a:b;}
inline int max(int a,int b) {return a>b?a:b;}
#define ULL unsigned long long
#define LL long long
#define INF 0x3f3f3f3f
#define INF_LL 0x3f3f3f3f3f3f3f3f
static char buf[1000000],*paa=buf,*pd=buf;
static char buf2[1000000],*pp=buf2;
#define getchar() paa==pd&&(pd=(paa=buf)+fread(buf,1,1000000,stdin),paa==pd)?EOF:*paa++
inline void pc(char ch){
	if(pp-buf2==1000000) fwrite(buf2,1,1000000,stdout),pp=buf2;
	*pp++=ch;
}
inline void pcc(){
	fwrite(buf2,1,pp-buf2,stdout);
	pp=buf2;
}
inline int read(void) {
	int w=1;
	register int x(0);register char c(getchar());
	while(c<'0'||c>'9') {if(c=='-') w=-1;c=getchar();}
	while(c>='0'&&c<='9') x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return w*x;
}
void write(int x) {
	if(x<0) pc('-'),x=-x;
	static int sta[20];
	int top=0;
	do {
		sta[top++]=x%10,x/=10;
	} while(x);
	while(top) pc(sta[--top]+48);
}
void we(int x) {
	write(x);
	pc('\n');
}
inline bool cmp_xi(int a,int b) {return a<b;}
inline bool cmp_da(int a,int b) {return a>b;}
int N,Q,su,hd[100009],pa[100009],dep[100009],a[100009],nxt[200009],to[200009],k,b[100009];
inline void l(int u,int v) {nxt[++k]=hd[u],to[k]=v,hd[u]=k;}
void dfs(int n,int f) {
	pa[n]=f;dep[n]=dep[f]+1;
	for(int i=hd[n];i;i=nxt[i]) {
		if(to[i]==f) continue;
		dfs(to[i],n);
	}
}
signed main(void) {
    //freopen("m.in","r",stdin);
    //freopen("m.out","w",stdout);
	N=read();Q=read();
	for(int i=1;i<N;i++) {
		int u=read(),v=read();
		l(u,v),l(v,u);
	} 
	dfs(1,0);
	for(int i=1;i<=N;i++) a[i]=read(),su+=a[i]*a[i];
	while(Q--) {
		int op=read();
		if(op==1) {
			int x=read(),v=read();
			su-=a[x]*a[x];
			su+=v*v;
			a[x]=v;
		} else {
			int m=read(),n=read(),v=read(),k=0;
			while(m!=n) {
				if(dep[m]<dep[n]) std::swap(m,n);
				b[++k]=a[m];
				m=pa[m];
			}
			b[++k]=a[m];
			int qq=su;
			for(int i=1;i<=k;i++) qq-=b[i]*b[i];
			int l=0,r=INF,md;
			while(l<r) {
				md=(l+r)>>1;
				int as=0;
				for(int i=1;i<=k;i++) {
					if(b[i]>=md) as+=b[i]-md;
				}
				if(as<=v) r=md;else l=md+1;
			}
			if(l==0) {
				printf("%lld\n",qq);
				continue;
			}
			int as=0,aq=0;
			for(int i=1;i<=k;i++) {
				if(b[i]>=l) as+=b[i]-l,aq+=l*l;else aq+=b[i]*b[i];
			}
			printf("%lld\n",aq-(v-as)*(2*l-1)+qq);
		}
	}
    return 0;
}