#搜索#SSL 2387 树

比赛

---

题目

---

分析

不就是搜索吗，好吧，还真是

---

代码

#include <cstdio>
#include <cctype>
#define maxn 100001
using namespace std; 
int n,m,father[maxn],a[maxn],w[maxn];
int in(){
	int ans=0; char c=getchar();
	while (!isdigit(c)) c=getchar();
	while (isdigit(c)) ans=ans*10+c-48,c=getchar();
	return ans;
}
int find(int y,int step){return (y)?(find(father[y],-step)+w[y]*step):0;}//符号取反
int main(){
	freopen("tree.in","r",stdin);
	freopen("tree.out","w",stdout);
    n=in(); m=in();
	for (int i=1;i<=n;i++) a[i]=in();
    for (int i=1;i<n;i++){
    	int x=in(); int y=in();
    	father[y]=x;//标记父亲
    }
    for (int i=1;i<=m;i++){
    	int x=in(),y=in(),z;
    	if (x==1) w[y]+=in();
		else printf("%d\n",a[y]+find(y,1));
    }
    return 0;
}