#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define max(x...) max({x})
#define min(x...) min({x})
#define FOR(i, x, y) for(int i = (x); i <= (y); i++)
#define ROF(i, x, y) for(int i = (x); i >= (y); i--)
inline LL rd()
{
    LL sign = 1, re = 0; char c = getchar();
    while(!isdigit(c)){if(c == '-') sign = -1; c = getchar();}
    while(isdigit(c)){re = re * 10 + (c - '0'); c = getchar();}
    return sign * re;
}
const int N = 1e5 + 5;
__int128 Sum;
int n, q, a[N];
int dfn[N], tn[N], dcnt;
int sz[N], st[N][17], dep[N];
vector<int> e[N];
void dfs(int now, int fa)
{
    dfn[now] = ++dcnt, tn[dcnt] = now;
    st[now][0] = fa, sz[now] = 1, dep[now] = dep[fa] + 1;
    FOR(i, 1, 16)
    {
        int la = st[now][i - 1];
        if(!la) break;
        st[now][i] = st[la][i - 1];
    }
    for(int to : e[now]) if(to != fa)
    {
        dfs(to, now);
        sz[now] += sz[to];
    }
}
inline int LCA(int x, int y)
{
    if(dep[x] < dep[y]) swap(x, y);
    ROF(i, 16, 0) if(dep[st[x][i]] >= dep[y])
        x = st[x][i];
    if(x == y) return x;
    ROF(i, 16, 0) if(st[x][i] != st[y][i])
        x = st[x][i], y = st[y][i];
    return st[x][0];
}
struct Node {int ty, x, y; LL w;} que[N];
int ss[N << 1], m = 1;
unordered_map<int, int> mp;
namespace Seg
{
    int tot1 = 1, tot2, root = 1;
    int ls1[N << 6], rs1[N << 6];
    int ls[N << 6], rs[N << 6], rt[N << 6];
    LL tr[N << 6], ttag[N << 6]; __int128 sum[N << 6], stag[N << 6]; int cnt[N << 6], ctag[N << 6];
    inline void ud(int now)
    {
        tr[now] = tr[ls[now]] + tr[rs[now]];
        sum[now] = sum[ls[now]] + sum[rs[now]];
        cnt[now] = cnt[ls[now]] + cnt[rs[now]];
    }
    inline void dn(int now, int l, int r)
    {
        int mid = (l + r) >> 1;
        if(ttag[now])
        {
            if(!ls[now]) ls[now] = ++tot2;
            if(!rs[now]) rs[now] = ++tot2;
            tr[ls[now]] += ttag[now] * (mid - l + 1), ttag[ls[now]] += ttag[now];
            tr[rs[now]] += ttag[now] * (r - mid), ttag[rs[now]] += ttag[now];
            ttag[now] = 0;
        }
        if(stag[now])
        {
            if(!ls[now]) ls[now] = ++tot2;
            if(!rs[now]) rs[now] = ++tot2;
            sum[ls[now]] += stag[now] * (mid - l + 1), stag[ls[now]] += stag[now];
            sum[rs[now]] += stag[now] * (r - mid), stag[rs[now]] += stag[now];
            stag[now] = 0;
        }
        if(ctag[now])
        {
            if(!ls[now]) ls[now] = ++tot2;
            if(!rs[now]) rs[now] = ++tot2;
            cnt[ls[now]] += ctag[now] * (mid - l + 1), ctag[ls[now]] += ctag[now];
            cnt[rs[now]] += ctag[now] * (r - mid), ctag[rs[now]] += ctag[now];
            ctag[now] = 0;
        }
    }
    void modify_region(int &now, int l, int r, int L, int R, int val, int ty)
    {
        if(!now) now = ++tot2;
        if(L <= l && r <= R)
        {
            tr[now] += 1ll * ty * val * (r - l + 1);
            ttag[now] += ty * val;
            sum[now] += (__int128)ty * val * val * (r - l + 1);
            stag[now] += (__int128)ty * val * val;
            cnt[now] += ty * (r - l + 1);
            ctag[now] += ty;
            return;
        }
        int mid = (l + r) >> 1; dn(now, l, r);
        if(L <= mid) modify_region(ls[now], l, mid, L, R, val, ty);
        if(mid < R) modify_region(rs[now], mid + 1, r, L, R, val, ty);
        ud(now);
    }
    void modify(int &now, int l, int r, int id, int val, int ty)
    {
        if(!now) now = ++tot1;
        modify_region(rt[now], 1, n, id, id + sz[tn[id]] - 1, val, ty);
        if(l == r) return;
        int mid = (l + r) >> 1;
        if(mp[val] <= mid) modify(ls1[now], l, mid, id, val, ty);
        else modify(rs1[now], mid + 1, r, id, val, ty);
    }
    void query(int now, int l, int r, int id, int ty, LL &nsum, __int128 &nsum2, int &ncnt)
    {
        if(!now) return;
        if(l == r)
        {
            nsum += tr[now] * ty;
            nsum2 += sum[now] * ty;
            ncnt += cnt[now] * ty;
            return;
        }
        int mid = (l + r) >> 1; dn(now, l, r);
        if(id <= mid) query(ls[now], l, mid, id, ty, nsum, nsum2, ncnt);
        else query(rs[now], mid + 1, r, id, ty, nsum, nsum2, ncnt);
    }
    inline int erfen(int l, int r, LL w, LL sum, __int128 sum2, int cnt)
    {
        int re = r;
        while(l <= r)
        {
            int mid = (l + r) >> 1;
            if(sum - 1ll * mid * cnt <= w) re = mid, r = mid - 1;
            else l = mid + 1;
        }
        return re;
    }
    void Div(int now, int l, int r, int u, int v, int lca, int falca, LL w, LL sum, __int128 sum2, int cnt, __int128 &sub)
    {
        if(l == r)
        {
            int val = erfen(ss[r], ss[r + 1], w, sum, sum2, cnt);
            if(!val) return void(sub = Sum);
            sub = sum2 - (__int128)cnt * val * val;
            w -= sum - 1ll * cnt * val;
            if(w) sub += (__int128)w * (2 * val - 1);
            return;
        }
        int mid = (l + r) >> 1;
        int ncnt = 0; LL nsum = 0; __int128 nsum2 = 0;
        if(rs1[now])
        {
            query(rt[rs1[now]], 1, n, u, 1, nsum, nsum2, ncnt);
            query(rt[rs1[now]], 1, n, v, 1, nsum, nsum2, ncnt);
            query(rt[rs1[now]], 1, n, lca, -1, nsum, nsum2, ncnt);
            if(falca) query(rt[rs1[now]], 1, n, falca, -1, nsum, nsum2, ncnt);
        }
        if(sum + nsum - 1ll * (ss[mid + 1] - 1) * (cnt + ncnt) <= w)
            Div(ls1[now], l, mid, u, v, lca, falca, w, sum + nsum, sum2 + nsum2, cnt + ncnt, sub);
        else Div(rs1[now], mid + 1, r, u, v, lca, falca, w, sum, sum2, cnt, sub);
    }
} using namespace Seg;
inline void print(__int128 x)
{
    if(!x) return void(puts("0"));
    int bit[30], cnt = 0;
    while(x) bit[++cnt] = x % 10, x /= 10;
    ROF(i, cnt, 1) putchar(bit[i] + '0');
    puts("");
}
signed main()
{
#ifndef ONLINE_JUDGE
    freopen("test.in", "r", stdin);
    freopen("test.out", "w", stdout);
#endif
    n = rd(), q = rd();
    FOR(i, 2, n)
    {
        int u = rd(), v = rd();
        e[u].emplace_back(v), e[v].emplace_back(u);
    }
    FOR(i, 1, n)
        a[i] = rd(),
        Sum += 1ll * a[i] * a[i],
        ss[++m] = a[i];
    FOR(i, 1, q)
    {
        int ty = rd(), x = rd(), y = rd();
        if(ty == 1) que[i] = (Node){ty, x, y, 0}, ss[++m] = y;
        else que[i] = (Node){ty, x, y, rd()};
    }
    sort(ss + 1, ss + 1 + m); m = unique(ss + 1, ss + 1 + m) - ss - 1;
    ss[m + 1] = ss[m]; FOR(i, 1, m) mp[ss[i]] = i;
    dfs(1, 0);
    FOR(i, 1, n) modify(root, 1, m, dfn[i], a[i], 1);
    FOR(i, 1, q)
    {
        if(que[i].ty == 1)
        {
            modify(root, 1, m, dfn[que[i].x], a[que[i].x], -1);
            Sum += 1ll * que[i].y * que[i].y - 1ll * a[que[i].x] * a[que[i].x];
            modify(root, 1, m, dfn[que[i].x], a[que[i].x] = que[i].y, 1);
        }
        else
        {
            __int128 sub = 0;
            int lca = LCA(que[i].x, que[i].y);
            Div(root, 1, m, dfn[que[i].x], dfn[que[i].y], dfn[lca], dfn[st[lca][0]], que[i].w, 0, 0, 0, sub);
            print(Sum - sub);
        }
    }
    return 0;
}