#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
#define fi first
#define se second
typedef pair<int, int> pii;
#define vi vector<int>
#define vii vector<pii>
const int N = 2e5 + 10;
int n, m, dfn[N], tot, sz[N], hv[N], fa[N], top[N], dep[N];
vector<int> g[N], son[N];
vii sub[N]; //子树
vii kson[N][4]; //儿子里距离恰好k
vii kans[N][4]; //到根距离 <= k
vii kdis[N][4]; //距离u <= k的所有点
vii fh[N][4]; //父亲去掉自己子树中距离父亲 <= k
namespace BIT {
    ull t1[N], t2[N];
    int lowbit(int x) { return x & (-x); }
    void upd(int x, int v) {
        for(int i = x; i <= n; i += lowbit(i))
            t1[i] += v, t2[i] += 1ull * x * v;
    }
    void add(int l, int r, int v) { upd(l, v), upd(r + 1, -v); }
    ull sum(int x) {
        ull res = 0;
        for(int i = x; i; i -= lowbit(i)) res += (x + 1) * t1[i] - t2[i];
        return res;
    }
    ull qry(int l, int r) { return sum(r) - sum(l - 1); }
}
int LCA(int x, int y) {
    while(top[x] != top[y]) {
        if(dep[top[x]] < dep[top[y]]) swap(x, y);
        x = fa[top[x]];
        // cout<<x<<" "<<y<<"!!!!!!\n";
    }
    return dep[x] < dep[y] ? x : y;
}
void mg(vii &a) {
    vii res;
    sort(a.begin(), a.end());
    for(auto v: a) {
        if(res.size() && res.back().se + 1 == v.fi) res.back().se = v.se;
        else res.emplace_back(v);
    }
    a = res;
}
void dfs1(int u, int fat) {
    sz[u] = 1, fa[u] = fat, dep[u] = dep[fat] + 1;
    for(auto v: g[u]) {
        if(v == fat) continue;
        dfs1(v, u), son[u].emplace_back(v);
        sz[u] += sz[v];
        if(sz[v] > sz[hv[u]]) hv[u] = v;
    }
}
void dfs2(int u) {//重标号
    vi v1, v2;
    for(int i = u; i; i = hv[i]) v1.emplace_back(i), top[i] = u;
    for(int i = 0; i <= 3; i++) {
        for(auto v: v1) {
            if(!dfn[v]) dfn[v] = ++tot;
            for(auto x: son[v]) v2.emplace_back(x);
        }
        v1 = v2, v2.clear();
    }
    for(int i = u; i; i = hv[i])
        for(auto v: son[i])
            if(v != hv[i]) dfs2(v);
}
void dfs3(int u) {
    sub[u].emplace_back(dfn[u], dfn[u]);
    kson[u][0].emplace_back(dfn[u], dfn[u]);
    for(auto v: son[u]) {
        dfs3(v);
        for(auto x: sub[v]) sub[u].emplace_back(x);
        for(int i = 0; i <= 3; i++) fh[v][i] = kson[u][i];
        for(int i = 1; i <= 3; i++) 
            for(auto x: kson[v][i - 1])
                kson[u][i].emplace_back(x);
    }
    for(int i = 0; i <= 3; i++) mg(kson[u][i]);
    vii tmp[4];
    for(int i = (int)son[u].size() - 1; i >= 0; i--) {
        int v = son[u][i];
        for(int j = 1; j <= 3; j++) {
            for(auto x: tmp[j]) fh[v][j].emplace_back(x);
            mg(fh[v][j]);
            for(auto x: kson[v][j - 1]) tmp[j].emplace_back(x);
        }
    }
    mg(sub[u]);
}

void dfs4(int u) {
    for(int i = 0; i <= 3; i++) {
        kans[u][i] = kans[fa[u]][i];
        for(auto v: kson[u][i]) kans[u][i].emplace_back(v);
        mg(kans[u][i]);
    }
    for(int i = 0; i <= 3; i++) {
        for(int j = 0; j <= i; j++) for(auto v: kson[u][j]) kdis[u][i].emplace_back(v);
        for(int j = 1, t = u; j <= i; j++) {
            for(int k = 0; k <= i - j; k++) 
                for(auto x: fh[t][k])
                    kdis[u][i].emplace_back(x);
            t = fa[t];
            if(!t) break;
        }
        mg(kdis[u][i]);
    }
    for(auto v: son[u]) dfs4(v);
}

vii getdel(int x, int y, int k) {
    vii a = kans[x][k], b = kans[y][k], res;
    int ca = a.size(), cb = b.size();
    for(int i = 0, l = 0, r = 0; i < ca; i++) {
        while(l < cb && b[l].se < a[i].fi) l++;
        r = l - 1;
        while(r + 1 < cb && b[r + 1].se <= a[i].se) r++;
        int las = a[i].fi;
        for(int j = l; j <= r; j++) {
            if(las < b[j].fi) res.emplace_back(las, b[j].fi - 1);
            las = b[j].se + 1;
        }
        if(las <= a[i].se) res.emplace_back(las, a[i].se);
    }
    mg(res);
    return res;
}
vii getpath(int x, int y, int k) {
    int lca = LCA(x, y);
    vii A = getdel(x, lca, k), B = getdel(y, lca, k);
    for(auto v: B) A.emplace_back(v);
    for(auto v: kdis[lca][k]) A.emplace_back(v);
    mg(A);
    return A;
}
int main() {
    // freopen("1.in", "r", stdin);
    // freopen("1.out", "w", stdout);
    cin>>n>>m;
    for(int i = 1, a, b; i < n; i++) {
        scanf("%d%d", &a, &b);
        g[a].emplace_back(b), g[b].emplace_back(a);
    }
    dfs1(1, 0), dfs2(1), dfs3(1), dfs4(1);
    // cout<<"#############\n";
    while(m--) {
        int op, x, y, v, k;
        scanf("%d", &op);
        if(op == 1) {
            scanf("%d%d%d%d", &x, &y, &k, &v);
            vii res = getpath(x, y, k);
            for(auto x: res) BIT::add(x.fi, x.se, v);
        }
        if(op == 2) {
            scanf("%d%d", &x, &v);
            for(auto y: sub[x]) BIT::add(y.fi, y.se, v); 
        }
        if(op == 3) {
            scanf("%d%d%d", &x, &y, &k);
            ull ans = 0;
            vii res = getpath(x, y, k);
            for(auto v: res) ans += BIT::qry(v.fi, v.se);
            printf("%llu\n", ans);
        }
        if(op == 4) {
            scanf("%d", &x);
            ull ans = 0;
            for(auto v: sub[x]) ans += BIT::qry(v.fi, v.se);
            printf("%llu\n", ans);
        }
    }

    return 0;
}