#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 100;
const long long int mod = 998244353;
const int inf = 1e9 + 100;
int st[N], com[N], par[N], l[N], r[N], h[N], ti = 1;
long long int seg[2][4 * N], lazy[2][4 * N];
vector<int> adj[N];
void dfs(int u, int i) {
  st[u] = ti++;
  com[u] = i;
  for (auto x : adj[u]) {
    if (x != par[u]) {
      h[x] = h[u] + 1;
      par[x] = u;
      dfs(x, i);
    }
  }
  if (adj[u].size() == 1) r[i] = u;
}
inline void upd(int ind) {
  seg[0][ind * 2] += lazy[0][ind];
  seg[0][ind * 2 + 1] += lazy[0][ind];
  lazy[0][ind * 2] += lazy[0][ind];
  lazy[0][ind * 2 + 1] += lazy[0][ind];
  lazy[0][ind] = 0;
  seg[1][ind * 2] += lazy[1][ind];
  seg[1][ind * 2 + 1] += lazy[1][ind];
  lazy[1][ind * 2] += lazy[1][ind];
  lazy[1][ind * 2 + 1] += lazy[1][ind];
  lazy[1][ind] = 0;
}
void add(int x, int L, int R, int val, int b = 0, int e = N, int ind = 1) {
  if (R <= b || e <= L) return;
  if (L <= b && e <= R) {
    seg[x][ind] += val;
    lazy[x][ind] += val;
    return;
  }
  upd(ind);
  int mid = (b + e) / 2;
  add(x, L, R, val, b, mid, ind * 2);
  add(x, L, R, val, mid, e, ind * 2 + 1);
  seg[x][ind] = seg[x][ind * 2] + seg[x][ind * 2 + 1];
}
long long int get(int x, int L, int R, int b = 0, int e = N, int ind = 1) {
  if (R <= b || e <= L) return 0;
  if (L <= b && e <= R) {
    return seg[x][ind];
  }
  upd(ind);
  int mid = (b + e) / 2;
  return get(x, L, R, b, mid, ind * 2) + get(x, L, R, mid, e, ind * 2 + 1);
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  int n, q;
  cin >> n >> q;
  for (int i = 0; i < n - 1; i++) {
    int x, y;
    cin >> x >> y;
    x--;
    y--;
    adj[x].push_back(y);
    adj[y].push_back(x);
  }
  for (int i = 0; i <= n; i++) com[i] = -1;
  for (int i = 0; i < adj[0].size(); i++) {
    int x = adj[0][i];
    l[i] = x;
    h[x] = 1;
    par[x] = 0;
    dfs(x, i);
    l[i] = st[l[i]];
    r[i] = st[r[i]];
  }
  while (q--) {
    int t;
    cin >> t;
    if (t == 0) {
      int u, d, val;
      cin >> u >> val >> d;
      u--;
      if (u == 0) {
        add(1, d, d + 1, val);
        continue;
      }
      int c = com[u];
      add(0, st[u], min(r[c], st[u] + d) + 1, val);
      add(0, max(l[c], st[u] - d), st[u], val);
      int k = d - h[u];
      if (k < 0) continue;
      add(1, k, k + 1, val);
      add(0, l[c], min(r[c] + 1, l[c] + k), -val);
    } else {
      int u;
      cin >> u;
      u--;
      cout << get(0, st[u], st[u] + 1) + get(1, h[u], n + 1) << endl;
    }
  }
  return 0;
}
