#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
//#define int long long   //__int128
#define int __int128
typedef pair<int, int> pii;
const int N= (int)1e5+ 5, M= N* 2, inf= (int)1e9;
int rd() {
  char ch= getchar();
  while(ch< '0'|| ch> '9') ch= getchar();
  int t= 0;
  while(ch>= '0'&& ch<= '9') t= (t<< 3)+ (t<< 1)+ ch- '0', ch= getchar();
  return t;
}
void wr(int x) {
  if(x> 9) wr(x/ 10);
  putchar(x% 10+ '0');
  return ;
}
struct node {
  int x, s, c, p;
};
int h[N], e[M], ne[M], idx, t[N];
void add(int a, int b) {
  e[idx]= b, ne[idx]= h[a], h[a]= idx++ ;
} 
int dep[N], fa[N][21], l[N], r[N], id, rid[N];
void dfs(int u, int f) {
  dep[u]= dep[f]+ 1;
  fa[u][0]= f;
  l[u]= ++ id;
  rid[id]= u;
  for(int i= h[u]; ~i; i= ne[i]) {
    int j= e[i];
    if(j== f) continue;
    dfs(j, u);
  }
  r[u]= id;
}
bool st;
int rt[N], bit[N], s[N* 35], c[N* 35], tot, ls[N* 35], rs[N* 35], ps[N* 35];
bool ed;
int n, q;
vector<pii> qut;
void ad(int &u, int v, int l, int r, int x, int y) {
  u= ++ tot;
  s[u]= s[v], c[u]= c[v], ps[u]= ps[v];
  ls[u]= ls[v], rs[u]= rs[v];
  s[u]+= y* x;
  c[u]+= y;
  ps[u]+= y* x* x;
  if(l== r) return ;
  int mid= l+ r>> 1;
  if(x<= mid) ad(ls[u], ls[v], l, mid, x, y);
  else ad(rs[u], rs[v], mid+ 1, r, x, y); 
}
void add(int &u, int l, int r, int x, int y) {
  if(! u) u= ++ tot;
  s[u]+= y* x;
  c[u]+= y;
  ps[u]+= y* x* x;
  if(l== r) return ;
  int mid= l+ r>> 1;
  if(x<= mid) add(ls[u], l, mid, x, y);
  else add(rs[u], mid+ 1, r, x, y); 
}
int m;
node qu(int l, int r, int us, int uc, int up) {
//  cout<< l<< ' '<< r<< endl;
  int cs= 0, ss= 0, pss= 0;
  for(pii i: qut)
    cs+= c[i.fi]* i.se, ss+= s[i.fi]* i.se, pss+= ps[i.fi]* i.se;
  if(l== r) return {l, ss+ us, cs+ uc, pss+ up};
  int mid= l+ r>> 1;
  vector<pii> qul, qur;
  for(pii i: qut) 
    qul.pb({ls[i.fi], i.se}), qur.pb({rs[i.fi], i.se});
  int cl= 0, sl= 0, psl= 0, cr= 0, sr= 0, psr= 0;
  for(pii i: qul)
    cl+= c[i.fi]* i.se, sl+= s[i.fi]* i.se, psl+= ps[i.fi]* i.se;
  for(pii i: qur)
    cr+= c[i.fi]* i.se, sr+= s[i.fi]* i.se, psr+= ps[i.fi]* i.se;
  if(sr+ us- mid* (cr+ uc)<= m) {
    qut= qul;
    return qu(l, mid, us+ sr, cr+ uc, up+ psr);
  }
  else {
    qut= qur;
    return qu(mid+ 1, r, us, uc, up);
  }
}
void pa(int x, int y, int t) {
  for(int i= x; i<= n; i+= i& -i)
    add(bit[i], 0, inf, y, t);
}
void pq(int x, int y) {
  qut.pb({rt[x], y});
  for(int i= x; i; i-= i& -i)
    qut.pb({bit[i], y});
}
int lca(int x, int y) {
  if(dep[x]< dep[y]) swap(x, y);
  for(int i= 20; i>= 0; i-- )
    if(dep[fa[x][i]]>= dep[y]) x= fa[x][i];
  if(x== y) return x;
  for(int i= 20; i>= 0; i-- )
    if(fa[x][i]!= fa[y][i]) x= fa[x][i], y= fa[y][i];
  return fa[x][0];
}
int ans= 0;
void bl() {
  memset(rt, 0, sizeof rt);
  memset(ls, 0, sizeof ls);
  memset(rs, 0, sizeof rs);
  memset(s, 0, sizeof s); 
  memset(c, 0, sizeof c);
  memset(ps, 0, sizeof ps); 
  ans= 0, tot= 0; 
 // cout<< 111<< endl;
  for(int i= 1; i<= n; i++ )
    ad(rt[l[i]], rt[l[fa[i][0]]], 0, inf, t[i], 1), ans+= t[i]* t[i];
  // for(int i= 1; i<= n; i++ )
  //   pa(l[i], t[i], 1), pa(r[i]+ 1, t[i], -1), ans+= t[i]* t[i], wr(tot), puts("");
 // wr(tot);
//  puts("");
}
signed main() {
  // freopen("PanzerSupply.in", "r", stdin);
  // freopen("PanzerSupply.out", "w", stdout);
//  cout<< (& ed- & st)/ 1024.0/ 1024.0<< endl;
  n= rd(), q= rd();
  memset(h, -1, sizeof h);
  for(int i= 1; i< n; i++ ) {
    int a= rd(), b= rd();
    add(a, b);
    add(b, a);
  }
  dfs(1, 0);
  for(int j= 1; j<= 20; j++ )
    for(int i= 1; i<= n; i++ )
      fa[i][j]= fa[fa[i][j- 1]][j- 1];
  ans= 0;
  for(int i= 1; i<= n; i++ )
    t[i]= rd();
  bl();
  while(q-- ) {
    int f= rd(), u= rd(), v= rd();
    if(f== 1) {
      pa(l[u], t[u], -1);
      pa(r[u]+ 1, t[u], 1);
      ans-= t[u]* t[u];
      t[u]= v;
      pa(l[u], t[u], 1);
      pa(r[u]+ 1, t[u], -1);
      ans+= t[u]* t[u];
      if(tot>= N* 25)  bl(); 
    }
    else {
      m= rd();
      int lc= lca(u, v);
//      cout<< lc<< endl;
//      cout<< lc<< endl;
      qut.clear();
      pq(l[u], 1), pq(l[v], 1), pq(l[lc], -1), pq(l[fa[lc][0]], -1);
      int ss= 0, pss= 0;
      for(pii i: qut)
        ss+= s[i.fi]* i.se, pss+= ps[i.fi]* i.se; 
//      cout<< ss<< ' '<< pss<< endl;     
      if(m>= ss) {
        wr(ans- pss);
        puts("");
        continue;
      }
 //     cout<< 111<< ' '<< ss<< ' '<< pss<< endl;
//      cout<< 111<< endl;
      node tmp= qu(0, inf, 0, 0, 0);
      int ls= m- tmp.s+ tmp.c* tmp.x;
      wr(ls* (tmp.x- 1)* (tmp.x- 1)+ (tmp.c- ls)* tmp.x* tmp.x+ pss- tmp.p+ ans- pss);
      puts("");
    }
  }
  return 0;
}