RT，思路大概是每次操作二就暴力更换重儿子、本身、父亲的子树大小、子树和、重儿子和父亲等信息。不知道为什么 WA 了。

睡觉去了，明天再看。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
#include<map>
#include<unordered_map>
#include<vector>
#include<queue>
#include<bitset>
#include<set>
#include<ctime>
#include<random>
#define x1 xx1
#define y1 yy1
#define IOS ios::sync_with_stdio(false)
#define ITIE cin.tie(0);
#define OTIE cout.tie(0);
#define PY puts("Yes")
#define PN puts("No")
#define PW puts("-1")
#define popcount __builtin_popcount
#define pii pair<int,int>
#define mp make_pair
#define fi first
#define se second
#define rep(a,b,c) for(int a=b;a<=c;a++)
#define per(a,b,c) for(int a=b;a>=c;a--)
#define reprange(a,b,c,d) for(int a=b;a<=c;a=d)
#define perrange(a,b,c,d) for(int a=b;a>=c;a=d)
#define graph(i,j,k,l) for(int i=k[j];i;i=l[i].nxt)
#define lowbit(x) (x&-x)
#define lson(x) (x<<1)
#define rson(x) (x<<1|1)
#define int long long
//#define int __int128
using namespace std;
inline int R(){
	int x=0,f=1;int ch=getchar();
	while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
	while(isdigit(ch)){x=x*10+ch-48;ch=getchar();}return x*f;
}
inline void write(int x){
	if(x<0){x=-x;putchar('-');}
	int y=0;char z[70];
	while(x||!y){z[y++]=x%10+48;x/=10;}
	while(y--)putchar(z[y]);
}
inline void writesp(int x){
	write(x);putchar(32);
}
inline void writeln(int x){
	write(x);putchar(10);
}
const int maxn=1e6+5,maxm=2e6+5;
int n,m,a[maxn];
struct edge{
	int to,nxt,w;
}e[maxm];
int head[maxn],edges;
void add(int x,int y,int z=0){
	e[++edges]=(edge){y,head[x],z};
	head[x]=edges;
}
int fa[maxn],siz[maxn],son[maxn],sum[maxn];
typedef struct{
	bool operator()(const int &x,const int &y){
		if(siz[x]!=siz[y]) return siz[x]>siz[y];
		else return x<y;
	}
}cmp;
set<int,cmp>v[maxn];
void dfs(int x,int y){
	sum[x]=a[x],siz[x]=1,fa[x]=y;
	graph(i,x,head,e){
		int u=e[i].to;
		if(u==y) continue;
		dfs(u,x); 
		sum[x]+=sum[u],siz[x]+=siz[u];
		v[x].insert(u);
	}
	if(!v[x].empty()) son[x]=*v[x].begin();
	else son[x]=0;
}
void solve_the_problem(){
	n=R(),m=R();
	rep(i,1,n)a[i]=R();
	rep(i,1,n-1){
		int x=R(),y=R();
		add(x,y),add(y,x);
	}
	dfs(1,0);
	rep(i,1,m){
		int op=R(),x=R();
		if(op==1){
			writeln(sum[x]);
		}else{
			if(!son[x]) continue;
			int sonx=son[x],fafa=fa[x]; 
			int sumx=sum[x],sizx=siz[x];
			sum[x]-=sum[sonx],sum[sonx]=sumx;
			siz[x]-=siz[sonx],siz[sonx]=sizx;
			fa[x]=sonx,fa[sonx]=fafa;
			v[x].erase(sonx);
			v[sonx].insert(x);
			v[fafa].erase(x);
			v[fafa].insert(sonx);
			son[sonx]=*v[sonx].begin();
			if(!v[x].empty()) son[x]=*v[x].begin();
			else son[x]=0;
			son[fafa]=*v[fafa].begin();
		}
	}
}
signed main(){int _=1;while(_--)solve_the_problem();}