萌新求教呜……

函数名过长会不会对程序效率/编译速度有影响……？

之前脑残写了个很长很长的函数名……然后编译蛮慢的，跑起来也不快

实际上真的会有影响吗w？

#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
using namespace std;
#define MAXN 100010
#define ll long long



///////////
int n,m;

int w1[MAXN],w2[MAXN];

struct qwq
{
	int nex,to;
}e[MAXN];
int h[MAXN]={};

int tot=0,cnt=0;

int dep[MAXN],top[MAXN],siz[MAXN],fa[MAXN],id[MAXN],son[MAXN];

ll ans[MAXN<<2],tag[MAXN<<2];
////////



void add(int x,int y)
{
	e[++tot].to=y;
	e[tot].nex=h[x];
	h[x]=tot;
}


inline void dfs_fir(int x,int f,int dept)
{
	dep[x]=dept;
	fa[x]=f;
	siz[x]=1;
	int maxn=-1;
	for (int i=h[x],y;i;i=e[i].nex)
	{
		y=e[i].to;
		if (y==f) continue;
		dfs_fir(y,x,dept+1);
		siz[x]+=siz[y];
		if (siz[y]>maxn)
		{
			son[x]=y;
			maxn=siz[y];
		}
	}
}

inline void dfs_sec(int x,int ft)
{
	id[x]=++cnt;
//	printf("id::%d",cnt);
	w2[cnt]=w1[x];
	top[x]=ft;
	if (!son[x]) return;
	dfs_sec(son[x],ft);
	int y;
	for (int i=h[x];i;i=e[i].nex)
	{
		y=e[i].to;
		if (y==fa[x]||y==son[x]) continue;
		dfs_sec(y,y);
	}
}
//segment_tree!
#define leftson cur<<1
#define rightson cur<<1|1
#define mid ((l+r)>>1)
#define push_up ans[cur]=ans[leftson]+ans[rightson]
#define push_down lazyadd(leftson,l,mid,tag[cur]); lazyadd(rightson,mid+1,r,tag[cur]); tag[cur]=0

inline void lazyadd(int cur,int l,int r,int del)
{
	tag[cur]+=del;
	ans[cur]+=del*(r-l+1);
//	ans[cur]%=mod;
}

inline void build(int cur,int l,int r)
{
	if (l==r)
	{
		ans[cur]=w2[l]/*%mod*/;
		return;
	}
	build(leftson,l,mid);
	build(rightson,mid+1,r);
	push_up;
}

inline void change(int adl,int adr,int cur,int l,int r,int del)
{
	if(adl<=l&&r<=adr)
	{
		ans[cur]+=del*(r-l+1)/*%mod*/;
		tag[cur]+=del;
		return;
	}
	push_down;
	if (adl<=mid) change(adl,adr,leftson,l,mid,del);
	if (adr>mid) change(adl,adr,rightson,mid+1,r,del);
	push_up;
}


ll query(int ql,int qr,int cur,int l,int r)
{
	if (ql<=l&&r<=qr)
	{
		return ans[cur];
	}
	push_down;
	ll answer=0;
	if (ql<=mid) answer+=query(ql,qr,leftson,l,mid)/*%mod*/;
	if (qr>mid) answer+=query(ql,qr,rightson,mid+1,r)/*%mod*/;
	return answer/*%mod*/;
}
//end.

void upd_olw(int x,int y)
{
	change(id[x],id[x],1,1,n,y);
}
void query_tree(int x)
{
	ll answ=0;
	while (top[x]!=1)
	{
		answ+=query(id[top[x]],id[x],1,1,n);
		x=fa[top[x]];
	}
	answ+=query(1,id[x],1,1,n);
	printf("%lld\n",answ);
}
void upd_sontree(int x,int y)
{
	change(id[x],id[x]+siz[x]-1,1,1,n,y);
//	printf("%d:::::::%d\n",id[x],siz[x]);
}

int main()
{
	scanf("%d%d",&n,&m);
	for (int i=1;i<=n;i++)
	{
		scanf("%d",&w1[i]);
	}
	for (int i=1,a,b;i<n;i++)
	{
		scanf("%d%d",&a,&b);
		add(a,b); add(b,a);
	}
	dfs_fir(1,0,1);
	dfs_sec(1,1);
	build(1,1,n);

	for (int i=1,q,x,y;i<=m;i++)
	{
		scanf("%d",&q);
		if (q==1)
		{
			scanf("%d%d",&x,&y);
			upd_olw(x,y);
			continue;
		}
		if (q==2)
		{
			scanf("%d%d",&x,&y);
			upd_sontree(x,y);
			continue;
		}
		scanf("%d",&x);
		query_tree(x);
	}
	return 0;
}