#include <iostream>

 #include <cstring>

 #include <cstdio>

 #include <algorithm>

 #define LL long long

 using namespace std;

 inline void Get_Int(LL &x)

 {

     x=;  char ch=getchar(); LL f=;

     while (ch<'' || ch>'') {if (ch=='-') f=-; ch=getchar();}

     while (ch>='' && ch<='') {x=x*+ch-''; ch=getchar();} x*=f;

 }

 inline void Put_Int(LL x)

 {

     char ch[]; LL top=;

     if (x<) putchar('-'),x=-x;

     if (x==) ch[++top]='';

     while (x) ch[++top]=x%+'',x/=;

     while (top) putchar(ch[top--]); putchar('\n');

 }

 //=============================================

 const LL Maxn=;

 LL Begin[Maxn],End[Maxn],c[Maxn],cv[Maxn],a[Maxn];

 LL head[Maxn],dep[Maxn];

 bool vis[Maxn];

 LL u,v,w,n,m,Type,cnt,tot;

 struct Edge{LL to,next;}edge[Maxn<<];

 inline LL lowbit(LL x) {return x&(-x);}

 struct BIT

 {

     LL c[Maxn];

     inline void Add(LL x,LL v) {for (LL i=x;i<=n;i+=lowbit(i)) c[i]+=v;}

     inline LL Sum(LL x) {LL ret=; for (LL i=x;i;i-=lowbit(i)) ret+=c[i]; return ret;}

     inline void Interval(LL x,LL y,LL w) {Add(x,w),Add(y+,-w);}

 }Bit1,Bit2;

 inline void AddE(LL u,LL v)

 {edge[cnt].to=v;edge[cnt].next=head[u];head[u]=cnt++;}

 void Dfs(LL u)

 {

     Begin[u]=++tot; vis[u]=true;

     for (LL i=head[u];i!=-;i=edge[i].next)

         if (!vis[edge[i].to])

             dep[edge[i].to]=dep[u]+,Dfs(edge[i].to);

     End[u]=tot;

 }

 inline void Modify_Point()

 {Get_Int(u),Get_Int(w);Bit1.Interval(Begin[u],End[u],w);}

 inline void Modify_Tree()

 {Get_Int(u),Get_Int(w);Bit1.Interval(Begin[u],End[u],(-dep[u])*w);Bit2.Interval(Begin[u],End[u],w);}

 inline LL Query()

 {Get_Int(u);return Bit1.Sum(Begin[u])+Bit2.Sum(Begin[u])*dep[u];}

 int main()

 {

     Get_Int(n),Get_Int(m);

     for (LL i=;i<=n;i++) Get_Int(a[i]);

     memset(head,-,sizeof(head)); tot=;

     for (LL i=;i<n;i++)

         Get_Int(u),Get_Int(v),AddE(u,v),AddE(v,u);

     memset(vis,false,sizeof(vis)); Dfs();

     for (LL i=;i<=n;i++) Bit1.Interval(Begin[i],End[i],a[i]);

     for (LL i=;i<=m;i++)

     {

         Get_Int(Type);

         if (Type==) Modify_Point();

         if (Type==) Modify_Tree();

         if (Type==) Put_Int(Query());

     }

     return ;

 }