#include<cstdio>
#include<cstring>

const int N=300000+10;

struct P{
	int to,nex;
};
P tree[N*2];
int head[N];
int top=0;

int v[N],fa[N];
int n;

void init_fa(int p=1,int f=1){
	fa[p]=f;
	for(int i=head[p];i!=-1;i=tree[i].nex)if(tree[i].to!=f)init_fa(tree[i].to,p);
}

int dfs(int p,int rest){
	if(p==-1)return 0;
	if(rest==0)return v[p];
	int ret=0;
	for(int i=head[p];i!=-1;i=tree[i].nex)if(tree[i].to!=fa[p])
		ret+=dfs(tree[i].to,rest-1);
	return ret;
}

void add_edge(int fro,int to){
	tree[top]=(P){to,head[fro]};
	head[fro]=top++;
	tree[top]=(P){fro,head[to]};
	head[to]=top++;
}

int main()
{
	freopen("newweapon.in","r",stdin);
	freopen("newweapon.out","w",stdout);
	memset(head,-1,sizeof(head));
	scanf("%d",&n);
	for(int i=1;i<=n;i++)scanf("%d",&v[i]);
	for(int i=1;i<n;i++){
		int fro,to;
		scanf("%d%d",&fro,&to);
		add_edge(fro,to);
	}
	init_fa();
	//for(int i=1;i<=n;i++)printf("%d ",fa[i]);putchar('\n');
	int q;
	scanf("%d",&q);
	for(int i=0;i<q;i++){
		int type,u,a;
		scanf("%d%d%d",&type,&u,&a);
		if(type==1)v[u]=a;
		else printf("%d\n",dfs(u,a));
	}
	return 0;
}