luoguP3178

再来一道模板，注意开long long

#include<bits/stdc++.h>
#define lowbit(x) ((x)&(-(x)))
#define ll long long
#define INF 2147483647
#define CLR(a) memset(a, 0, sizeof(a))
using namespace std;
#define ls (rt<<1)
#define rs (rt<<1|1)
#define MID(a,b) (a+((b-a)>>1))
const int maxn=2e5+10;
int head[maxn],cnt,mod;
int w[maxn],wt[maxn];
int pt;//dfs递增编号 
int son[maxn],id[maxn],fa[maxn],dep[maxn],size[maxn],top[maxn]; 
struct Edge{
	int nxt,to;
}edge[maxn];
//链式前向星存图 
void add(int u,int v){
	edge[++cnt].to=v;
	edge[cnt].nxt=head[u];
	head[u]=cnt;
}
struct node{
	int l,r;
	ll sum,lazy;
	int mid(){return MID(l,r);}
	void fun(ll tmp){
		lazy+=tmp;
		sum+=tmp*(r-l+1);
	}
};
struct Segtree{
	node tree[maxn<<2];
	void push_up(ll rt){
		tree[rt].sum=tree[ls].sum+tree[rs].sum;
	}
	void push_down(ll rt){
		ll tmp=tree[rt].lazy;
		if(tmp){
			tree[ls].fun(tmp);
			tree[rs].fun(tmp);
			tree[rt].lazy=0;
		}
	}
	void build(int l,int r,int rt){
		tree[rt].l=l;tree[rt].r=r; 
		if(l==r){
			tree[rt].sum=wt[l];
		}else{
			int mid=tree[rt].mid();
			build(l,mid,ls);
			build(mid+1,r,rs);
			push_up(rt);
		}
	}
	void update(int st,int ed,int rt,ll val){
		int l=tree[rt].l,r=tree[rt].r;
		if(st<=l&&r<=ed) tree[rt].fun(val);
		else{
			push_down(rt);
			int mid=tree[rt].mid();
			if(st<=mid) update(st,ed,ls,val);
			if(ed>mid) update(st,ed,rs,val);
			push_up(rt);
		}
	}
	ll query(int st,int ed,int rt){
		int l=tree[rt].l,r=tree[rt].r;
		if(st<=l&&r<=ed) return tree[rt].sum;
		else{
			push_down(rt);
			int mid=tree[rt].mid();
			ll sum1=0,sum2=0;
			if(st<=mid) sum1=query(st,ed,ls);
			if(ed>mid) sum2=query(st,ed,rs);
			return sum1+sum2;
		}
	}
}seg;
//x到y的点权和
ll xy_dist(ll x,ll y){ 
	ll ans=0;
	while(top[x]!=top[y]){
		if(dep[top[x]]<dep[top[y]]) swap(x,y);
		ans=ans+seg.query(id[top[x]],id[x],1);
		x=fa[top[x]];
	}
	if(dep[x]>dep[y]) swap(x,y);
	ans+=seg.query(id[x],id[y],1);
	return ans;
}
//x节点子树所有节点+val 
void update_son(ll x,ll val){
	seg.update(id[x],id[x]+size[x]-1,1,val);
}
//x到y所有点+val 
void updxy_dist(int x,int y,ll val){
	while(top[x]!=top[y]){
		if(dep[top[x]]<dep[top[y]]) swap(x,y);
		seg.update(id[top[x]],id[x],1,val);
		x=fa[top[x]];
	}
	if(dep[x]>dep[y]) swap(x,y);
	seg.update(id[x],id[y],1,val);
}
void dfs_1(int cur,int fath,int deep){
	dep[cur]=deep;
	fa[cur]=fath;
	size[cur]=1;
	int maxson=-1;//记录重儿子的儿子数
	for(int i=head[cur];i;i=edge[i].nxt){
		int to=edge[i].to;
		if(to==fath) continue;
		dfs_1(to,cur,deep+1);
		size[cur]+=size[to];
		if(size[to]>maxson) son[cur]=to,maxson=size[to];
	} 
}
void dfs_2(int cur,int topf){//topf为当前链最顶端节点 
	id[cur]=++pt;
	wt[pt]=w[cur];
	top[cur]=topf;
	if(!son[cur]) return;
	dfs_2(son[cur],topf);
	for(int i=head[cur];i;i=edge[i].nxt){
		int to=edge[i].to;
		if(to==fa[cur]||to==son[cur]) continue;
		dfs_2(to,to);//轻儿子topf是它自身 
	}
} 
int n,m,r;
int main() {
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++) scanf("%d",&w[i]);
	for(int i=1;i<n;i++){
		int a,b;
		scanf("%d%d",&a,&b);
		add(a,b);
		add(b,a);
	}
	dfs_1(1,0,1);
	dfs_2(1,1);
	seg.build(1,n,1);
	while(m--){
		int typ,x,y;
		scanf("%d",&typ);
		if(typ==1){
			scanf("%d%d",&x,&y);
			updxy_dist(x,x,y);
		}else if(typ==2){
			scanf("%d%d",&x,&y);
			update_son(x,y);
		}else{
			scanf("%d",&x);
			printf("%lld\n",xy_dist(1,x));
		}
	}
	return 0;
}