#include<bits/stdc++.h>

 #define int long long

 #define writeln(x)  write(x),puts("")

 using namespace std;

 inline int read(){

     int ans=,f=;char chr=getchar();

     while(!isdigit(chr)){if(chr=='-') f=-;chr=getchar();}

     while(isdigit(chr)){ans=(ans<<)+(ans<<)+chr-;chr=getchar();}

     return ans*f;

 }void write(int x){

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

     if(x>) write(x/);

     putchar(x%+'');

 }const int M = 1e5+;

 int head[M],ver[M<<],nxt[M<<],tot,n,m,dfn[M],b[M],a[M],fa[M][],sz[M],T,dep[M],s[M<<],lz[M<<],root,x,y,z,t,ans;

 inline void add(int x,int y){ver[++tot]=y,nxt[tot]=head[x],head[x]=tot;}

 void dfs(int x,int f){

     dfn[x]=++T,fa[x][]=f,b[dfn[x]]=a[x],dep[x]=dep[f]+,sz[x]=;

     for(int i=;(<<i)<=dep[x];i++)fa[x][i]=fa[fa[x][i-]][i-];

     for(int i=head[x];i;i=nxt[i]){

         if(ver[i]==f) continue;

         dfs(ver[i],x);

         sz[x]+=sz[ver[i]];

     }

 }

 int LCA(int x,int y){

     if(dep[x]<dep[y]) swap(x,y);

     for(int i=;i>=;i--)if(dep[x]-(<<i)>=dep[y]) x=fa[x][i];

     if(x==y) return x;

     for(int i=;i>=;i--)

         if(fa[x][i]!=fa[y][i])

             x=fa[x][i],y=fa[y][i];

     return fa[x][];

 }

 #define ls (i<<1)

 #define rs (i<<1|1)

 #define mid (l+r>>1)

 inline void Push_Up(int i){s[i]=s[ls]+s[rs];}

 inline void Push_Down(int i,int l,int r){

     if(!lz[i]) return;

     s[ls]+=lz[i]*(mid-l+);

     s[rs]+=lz[i]*(r-mid);

     lz[ls]+=lz[i],lz[rs]+=lz[i];

     lz[i]=;

 }

 void Build(int i,int l,int r){

     if(l==r) return (void)(s[i]=b[l]);

     Build(ls,l,mid),Build(rs,mid+,r);

     Push_Up(i);

 }

 void Update(int i,int l,int r,int ql,int qr,int x){

     if(ql<=l&&r<=qr)return (void)(s[i]+=(r-l+)*x,lz[i]+=x);

     Push_Down(i,l,r);

     if(ql<=mid) Update(ls,l,mid,ql,qr,x);

     if(qr>mid)  Update(rs,mid+,r,ql,qr,x);

     Push_Up(i);

 }

 int Query(int i,int l,int r,int ql,int qr){

     if(ql<=l&&r<=qr) return s[i];

     int ans=;Push_Down(i,l,r);

     if(ql<=mid) ans+=Query(ls,l,mid,ql,qr);

     if(qr>mid)  ans+=Query(rs,mid+,r,ql,qr);

     return ans;

 }

 inline int Get_Point(int x,int y){

     int l1=LCA(x,y),l2=LCA(x,root),l3=LCA(y,root);

     if(dep[l1]<dep[l2]) swap(l1,l2);

     if(dep[l1]<dep[l3]) swap(l1,l3);

     return l1;

 }

 inline Get(int x,int d){for(int i=;i>=;i--) if((<<i)&d) x=fa[x][i];return x;}

 inline void Solve_1(){

     x=read(),y=read(),z=read();

     t=Get_Point(x,y);

     if(t==root) return (void)(Update(,,n,,n,z));

     if(dfn[t]>dfn[root]||dfn[t]+sz[t]-<dfn[root]) return (void)(Update(,,n,dfn[t],dfn[t]+sz[t]-,z));

     int tmp=Get(root,dep[root]-dep[t]-);

     Update(,,n,,n,z);Update(,,n,dfn[tmp],dfn[tmp]+sz[tmp]-,-z);

 }

 inline void Solve_2(){

     x=read();

     if(x==root) return (void)(writeln(Query(,,n,,n)));

     if(dfn[x]>dfn[root]||dfn[x]+sz[x]-<dfn[root]) return (void)(writeln(Query(,,n,dfn[x],dfn[x]+sz[x]-)));

     int tmp=Get(root,dep[root]-dep[x]-);

     ans=Query(,,n,,n);ans-=Query(,,n,dfn[tmp],dfn[tmp]+sz[tmp]-);

     writeln(ans);

 }

 signed main(){

     n=read(),m=read();

     for(int i=;i<=n;i++) a[i]=read();

     for(int i=;i<n;i++)x=read(),y=read(),add(x,y),add(y,x);

     dfs(,);Build(,,n);root=;

     while(m--){

         int opt=read();

         if(opt==) root=read();

         if(opt==) Solve_1();

         if(opt==) Solve_2();

     }

     return ;

 }