#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
using namespace std;
int n,q,a,u,c;
int i,j,l,ans=0;
struct tree{
	int v;
	int d;
	int lian;
	int z[2];
}t[300001];
struct bian{
	int fr,to;
}b[300001];
int main()
{
	freopen("newweapon.in","r",stdin);
	freopen("newweapon.out","w",stdout);
	cin>>n>>q;
	for(i=0;i<n;i++)
	  {
	  	cin>>t[i].v;
	  }
	for(i=0;i<n-1;i++)
	  {
	  	cin>>b[i].fr>>b[i].to;
	  	t[b[i].fr].lian++;
	  	t[b[i].fr].z[t[b[i].fr].lian]=b[i].to;
	  	t[b[i].to].d++;
	  }
	for(l=0;l<q;l++)
	  {
	  	cin>>a>>u>>c;
	  	if(a==1)
	  	  {
	  	  	t[u].v=c;
	  	  }
	  	if(a==2)
	  	  {
	  	  	for(j=0;j<n;j++)
	  	  	  {
	  	  	  	if(t[j].d-t[u].d==c)
	  	  	  	  ans+=t[j].v;
	  	  	  }
	  	  }
	  	cout<<ans<<endl;
	  }
	fclose(stdin);fclose(stdout);
	return 0;
}