#include<bits/stdc++.h>
using namespace std;
template <typename T>inline void read(T &x)
{
    x=0;char c=getchar();bool f=0;
    for(;c<'0'||c>'9';c=getchar())f|=(c=='-');
    for(;c>='0'&&c<='9';c=getchar())x=(x<<1)+(x<<3)+(c-'0');
    x=(f?-x:x);
}
typedef unsigned long long ull;
const int N = 2e5+7;
typedef long long LL;
int n;
vector<int> G[N],T[N];
int fa[N],siz[N],son[N],dfn[N],dep[N],top[N],seq[N],tot=0;
void dfs(int x,int pre)
{
    fa[x]=pre;siz[x]=1;dep[x]=dep[pre]+1;
    for(int y:T[x])if(y!=pre)
    {
        dfs(y,x);
        siz[x]+=siz[y];
        G[x].push_back(y);
        if(siz[y]>siz[son[x]])son[x]=y;
    }
}
struct BIT
{
    ull d[N],c[N];
    void add1(int x,ull v){for(int i=x;i<=n+1;i+=i&-i)d[i]+=v;}
    void add2(int x,ull v){for(int i=x;i<=n+1;i+=i&-i)c[i]+=v;}
    ull ask1(int x){ull res=0;for(int i=x;i;i-=i&-i)res+=d[i];return res;}
    ull ask2(int x){ull res=0;for(int i=x;i;i-=i&-i)res+=c[i];return res;}
    inline ull sum(int x){return ask1(x)*(x+1)-ask2(x);}
    inline void add(int l,int r,ull v){if(l>r)return;add1(l,v);add1(r+1,-v);add2(l,v*l);add2(r+1,-v*(r+1));}
    inline ull ask(int l,int r){if(l>r)return 0;return sum(r)-sum(l-1);}
}DS;
void extend(int x,int t)
{
    if(!dfn[x])seq[dfn[x]=++tot]=x;
    if(!t)return;
    for(int y:G[x])extend(y,t-1);
}
void dfs2(int x,int topth)
{
    top[x]=topth;
    if(x==topth)
    {
        for(int i=0;i<=3;i++)
        for(int u=x;u;u=son[u])extend(u,i);
    }
    if(!son[x])return;
    dfs2(son[x],topth);
    for(int y:G[x])if(y!=fa[x]&&y!=son[x])dfs2(y,y);
}
#define pii pair<int,int>
#define mk(x,y) make_pair(x,y)
#define l(x) x.first
#define r(x) x.second
#define segment vector<pii>
segment operator +(segment A,segment B)
{
    if(A.empty())return B;
    if(B.empty())return A;
    segment C;
    int i=0,j=0,l=-1;
    while(i<(int)A.size()||j<(int)B.size())
    {
        pii cur;
        if(j>=(int)B.size()||(i<(int)A.size()&&A[i].first<B[j].first))
        cur=A[i++];
        else cur=B[j++];
        if(l(cur)==l+1)C.back().second=cur.second;
        else C.push_back(cur);
        l=cur.second;
    }
    return C;
}
segment tree[N];
void dfs3(int x,int pre)
{
    tree[x].push_back(mk(dfn[x],dfn[x]));
    for(int y:G[x])
    {
        dfs3(y,x);
        tree[x]=tree[x]+tree[y];
    }
}
segment A[N][4],W[N][4];
bool vis[N];
segment S;
void get(int x,int d)
{
    segment cur;cur.push_back({dfn[x],dfn[x]});
    if(!d){S=S+cur;return;}
    for(int y:G[x])if(!vis[y])get(y,d-1);
}
void dfs4(int x)
{
    for(int d=0;d<=3;d++)
    {
        S.clear();
        get(x,d);
        W[x][d]=S;
    }
    if(x==top[x])
    {
        for(int u=x;u;u=son[u])vis[u]=1;
        for(int d=0;d<=3;d++)
        {
            S.clear();
            for(int u=x;u;u=son[u])
            {
                get(u,d);
                if(d)A[u][d]=A[u][d-1];
                A[u][d]=A[u][d]+S;
            }
        }
        for(int u=x;u;u=son[u])vis[u]=1;
    }
    if(!son[x])return;
    dfs4(son[x]);
    for(int y:G[x])if(y!=son[x])
    dfs4(y);
}
void apply(int x,int k,ull v)
{
    int lst=x;
    for(int i=1;i<=k;i++)
    {
        lst=x;
        x=fa[x];
        if(!x)return;
        for(auto u:W[x][k-i])DS.add(l(u),r(u),v);
        if(i<k)for(auto u:W[lst][k-i-1])DS.add(l(u),r(u),-v);
    }
}
void modify(int x,int y,int k,int v)
{
    int lstx=0,lsty=0;
    while(top[x]!=top[y])
    {
        if(dep[top[x]]<dep[top[y]])swap(x,y),swap(lstx,lsty);
        for(auto u:A[x][k])DS.add(l(u),r(u),v);
        if(lstx&&k)for(auto u:W[lstx][k-1])DS.add(l(u),r(u),-v);
        if(son[x]&&k)for(auto u:W[son[x]][k-1])DS.add(l(u),r(u),v);
        x=fa[top[x]];
    }
    if(dep[x]>dep[y])swap(x,y),swap(lstx,lsty);
    for(auto u:A[y][k])DS.add(l(u),r(u),v);
    if(x!=top[x])
    for(auto u:A[fa[x]][k])DS.add(l(u),r(u),-v);
    if(lstx&&k)for(auto u:W[lstx][k-1])DS.add(l(u),r(u),-v);
    if(lsty&&k)for(auto u:W[lsty][k-1])DS.add(l(u),r(u),-v);
    if(son[y]&&k)for(auto u:W[son[y]][k-1])DS.add(l(u),r(u),v);
    if(k)apply(x,k,v);
}
ull getans(int x,int k)
{
    ull res=0;
    int lst=x;
    for(int i=1;i<=k;i++)
    {
        lst=x;
        x=fa[x];
        if(!x)break;
        for(auto u:W[x][k-i])res+=DS.ask(l(u),r(u));
        if(i<k)for(auto u:W[lst][k-i-1])res+=DS.ask(l(u),r(u));
    }
    return res;
}
ull query(int x,int y,int k)
{
    ull res=0;
    int lstx=0,lsty=0;
    while(top[x]!=top[y])
    {
        if(dep[top[x]]<dep[top[y]])swap(x,y),swap(lstx,lsty);
        for(auto u:A[x][k])res+=DS.ask(l(u),r(u));
        if(lstx&&k)for(auto u:W[lstx][k-1])res+=DS.ask(l(u),r(u));
        if(son[x]&&k)for(auto u:W[son[x]][k-1])res+=DS.ask(l(u),r(u));
        x=fa[top[x]];
    }
    if(dep[x]>dep[y])swap(x,y),swap(lstx,lsty);
    for(auto u:A[y][k])res+=DS.ask(l(u),r(u));
    if(x!=top[x])
    for(auto u:A[fa[x]][k])res+=DS.ask(l(u),r(u));
    if(lstx&&k)for(auto u:W[lstx][k-1])res+=DS.ask(l(u),r(u));
    if(lsty&&k)for(auto u:W[lsty][k-1])res+=DS.ask(l(u),r(u));
    if(son[y]&&k)for(auto u:W[son[y]][k-1])res+=DS.ask(l(u),r(u));
    if(k)res+=getans(x,k);
    return res;
}
int main()
{
    int m;
    read(n);read(m);
    for(int i=1;i<n;i++)
    {
        int u,v;
        read(u);read(v);
        T[u].push_back(v);
        T[v].push_back(u);
    }
    dfs(1,0);dfs2(1,1);
    dfs3(1,0);dfs4(1);
    while(m--)
    {
        int op,x,y,k,v;
        read(op);
        if(op==1)
        {
            read(x);read(y);read(k);read(v);
            modify(x,y,k,v);
        }
        else if(op==2)
        {
            read(x);read(v);
            for(auto u:tree[x])DS.add(l(u),r(u),v);
        }
        else if(op==3)
        {
            read(x);read(y);read(k);
            printf("%lld\n",query(x,y,k));
        }
        else if(op==4)
        {
            read(x);
            ull res=0;
            for(auto u:tree[x])res+=DS.ask(l(u),r(u));
            printf("%lld\n",res);

        }
    }
    return 0;
}