#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit32(x) (1 << (x))
#define bit64(x) (1ll << (x))

using namespace std;

using i32 = int;
using i64 = long long;
using u64 = unsigned long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vu64 = vector<u64>;
using vf80 = vector<f80>;
using vstr = vector<string>;

inline void yes() { cout << "Yes" << '\n'; exit(0); }
inline void no() { cout << "No" << '\n'; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); return a / gcd(a, b) * b; }
inline u64 xorshift() { static u64 x = 88172645463325252ull; x = x ^ (x << 7); return x = x ^ (x >> 9); }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { if (x < y) x = y; }
template <typename T> inline void amin(T &x, T y) { if (x > y) x = y; }
template <typename T> inline T exp(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> inline T bis(T ok, T ng, function<bool(T)> f, T eps = 1) { while (abs(ok - ng) > eps) { T mi = (ok + ng) / 2; (f(mi) ? ok : ng) = mi; } return ok; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { each(x, v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }

struct HLD {
  vector<vector<int>> g;
  vector<int> vid;
  vector<int> out;
  vector<int> head;
  vector<int> par;
  vector<int> ddep;
  HLD(vector<vector<int>> g) : g(g) {
    int n = g.size();
    vid = vector<int>(n);
    out = vector<int>(n);
    head = vector<int>(n);
    par = vector<int>(n, -1);
    ddep = vector<int>(n);
    {
      vector<int> sz(n);
      auto dfs = [&](auto dfs, int u, int p) -> void {
        sz[u] = 1;
        for (auto &v : g[u]) if (v != p) {
          par[v] = u;
          dfs(dfs, v, u);
          sz[u] += sz[v];
          if (sz[v] > sz[g[u][0]]) swap(v, g[u][0]);
        }
      };
      dfs(dfs, 0, -1);
    }
    {
      int t = 0;
      auto dfs = [&](auto dfs, int u, int p) -> void {
        vid[u] = t++;
        for (auto v : g[u]) if (v != p) {
          if (v == g[u][0]) {
            head[v] = head[u];
            ddep[v] = ddep[u];
          } else {
            head[v] = v;
            ddep[v] = ddep[u] + 1;
          }
          dfs(dfs, v, u);
        }
        out[u] = t;
      };
      dfs(dfs, 0, -1);
    }
  }
  void for_each(int u, int v, function<void(int, int)> f) {
    while (true) {
      if (ddep[u] > ddep[v]) swap(u, v);
      if (head[u] == head[v]) {
        f(min(vid[u], vid[v]), max(vid[u], vid[v]) + 1);
        return;
      }
      f(vid[head[v]], vid[v] + 1);
      v = par[head[v]];
    }
  }
  void for_each_edge(int u, int v, function<void(int, int)> f) {
    while (true) {
      if (ddep[u] > ddep[v]) swap(u, v);
      if (head[u] == head[v]) {
        f(min(vid[u], vid[v]) + 1, max(vid[u], vid[v]) + 1);
        return;
      }
      f(vid[head[v]], vid[v] + 1);
      v = par[head[v]];
    }
  }
  int lca(int u, int v) {
    while (true) {
      if (ddep[u] > ddep[v]) swap(u, v);
      if (head[u] == head[v]) {
        return vid[u] < vid[v] ? u : v;
      }
      v = par[head[v]];
    }
  }
  pair<int, int> subtree(int u) {
    return make_pair(vid[u], out[u]);
  }
  pair<int, int> subtree_edge(int u) {
    return make_pair(vid[u] + 1, out[u]);
  }
  int operator[](int k) {
    return vid[k];
  }
};

template <typename T, typename S>
struct LazySegmentTree {
  using F = function<T(T, T)>;
  using G = function<T(T, S, int)>;
  using H = function<S(S, S)>;

  vector<T> v;
  vector<S> z;
  F f;
  G g;
  H h;
  T e;
  S d;
  int n;

  LazySegmentTree(int size, F f, G g, H h, T e, S d) : f(f), g(g), h(h), e(e), d(d) {
    n = 1;
    while (n < size) n <<= 1;
    v.resize(n * 2, e);
    z.resize(n * 2, d);
  }
  
  void set(int k, T x) {
    v[k + n] = x;
  }

  void build() {
    rrep(i, n) v[i] = f(v[i * 2 + 0], v[i * 2 + 1]);
  }

  void propagate(int k, int l, int r) {
    v[k] = g(v[k], z[k], r - l);
    if (k < n) {
      z[k * 2 + 0] = h(z[k * 2 + 0], z[k]);
      z[k * 2 + 1] = h(z[k * 2 + 1], z[k]);
    }
    z[k] = d;
  }

  T update(int a, int b, S x, int k = 1, int l = 0, int r = -1) {
    if (r == -1) r = n;
    propagate(k, l, r);
    if (b <= l || r <= a) return v[k];
    if (a <= l && r <= b) { z[k] = x; propagate(k, l, r); return v[k]; }
    return v[k] = f(
      update(a, b, x, k * 2 + 0, l, (l + r) / 2),
      update(a, b, x, k * 2 + 1, (l + r) / 2, r)
    );
  }

  T query(int a, int b, int k = 1, int l = 0, int r = -1) {
    if (r == -1) r = n;
    propagate(k, l, r);
    if (b <= l || r <= a) return e;
    if (a <= l && r <= b) return v[k];
    return f(
      query(a, b, k * 2 + 0, l, (l + r) / 2),
      query(a, b, k * 2 + 1, (l + r) / 2, r)
    );
  }
};

void solve() {
  int n, q;
  cin >> n >> q;
  vector<vi32> g(n);
  rep(i, n - 1) {
    int a, b;
    cin >> a >> b;
    g[a].push_back(b);
    g[b].push_back(a);
  }
  auto hld = HLD(g);
  auto lst = LazySegmentTree<i64, i64>(n,
    [](i64 a, i64 b) { return a + b; },
    [](i64 a, i64 b, int k) { return a + b * k; },
    [](i64 a, i64 b) { return a + b; },
    0, 0);
  rep(i, q) {
    int a, b, c;
    cin >> a >> b >> c;
    if (a == 0) {
      int u = b, v = c;
      i64 sum = 0;
      hld.for_each_edge(u, v, [&](int l, int r) { sum += lst.query(l, r); });
      cout << sum << endl;
    } else {
      int v = b, x = c;
      int l, r;
      tie(l, r) = hld.subtree_edge(v);
      lst.update(l, r, x);
    }
  }
}



Measured memory_bytes: 38684