#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int s[N], e[N], sum[N * 2], t[N * 2], d[N], ind[N], pos = 1, par[N];
vector<int> adj[N];
void dfs(int x, int p) {
  if (p == 1) par[x] = x;
  if (p > 1) par[x] = par[p];
  ind[x] = pos;
  s[x] = pos++;
  int u, i;
  d[x] = d[p] + 1;
  for (i = 0; i < adj[x].size(); ++i) {
    u = adj[x][i];
    if (u != p) dfs(u, x);
  }
  e[x] = pos - 1;
}
void su(int l, int r, int v, int ty) {
  int *p = t;
  if (ty) p = sum;
  for (l += N, r += N; l < r; l >>= 1, r >>= 1) {
    if (l & 1) p[l++] += v;
    if (r & 1) p[--r] += v;
  }
}
int sq(int l, int ty) {
  int ret = 0;
  l += N;
  int *p = t;
  if (ty) p = sum;
  for (; l > 0; l >>= 1) ret += p[l];
  return ret;
}
int main() {
  int type, v, x, y, n, i, a, b, q, st, lt, p;
  cin >> n >> q;
  for (i = 0; i < n - 1; ++i) {
    scanf("%d%d", &a, &b);
    adj[a].push_back(b);
    adj[b].push_back(a);
  }
  d[0] = -1;
  dfs(1, 0);
  while (q--) {
    scanf("%d", &type);
    if (type == 0) {
      scanf("%d%d%d", &v, &x, &y);
      if (y >= d[v]) {
        a = y - d[v];
        su(0, a + 1, x, 1);
        p = par[v];
        lt = e[p], st = ind[p] + a;
        lt = min(ind[v] + y, lt);
      } else {
        p = par[v];
        lt = e[p];
        st = ind[p];
        st = max(st, ind[v] - y);
        lt = min(lt, ind[v] + y);
      }
      if (v != 1) su(st - 1, lt, x, 0);
    } else {
      scanf("%d", &x);
      printf("%d\n", sq(d[x], 1) + sq(ind[x] - 1, 0));
    }
  }
}
