#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 100000 + 20;
struct BIT {
  int size;
  vector<long long> fen;
  BIT() { size = 0; }
  BIT(int n) {
    size = n;
    fen.resize(n + 1);
  }
  void add(int x, int val) {
    for (; x <= size; x += (x) & (-x)) fen[x] += val;
  }
  long long get(int x) {
    long long val = 0;
    for (; x > 0; x -= (x) & (-x)) val += fen[x];
    return val;
  }
};
vector<int> adj[MAX_N];
vector<BIT> a;
int mark[MAX_N], lvl[MAX_N];
int n, Q, head = 1;
long long rootAns;
int dfs(int v, int col) {
  mark[v] = col;
  int res = 1;
  for (int i = 0; i < adj[v].size(); i++) {
    int u = adj[v][i];
    if (mark[u]) continue;
    lvl[u] = lvl[v] + 1;
    res += dfs(u, col);
  }
  return res;
}
void addInterVal(int x, int l, int r, int val) {
  if (l > r || !l || !r) return;
  a[x].add(l, val);
  a[x].add(r + 1, -val);
}
int main() {
  ios::sync_with_stdio(false);
  cin >> n >> Q;
  for (int i = 0; i < n - 1; i++) {
    int v, u;
    cin >> v >> u;
    --v, u--;
    adj[v].push_back(u);
    adj[u].push_back(v);
  }
  a.push_back(BIT(n));
  mark[0] = 1;
  for (int i = 0; i < adj[0].size(); i++) {
    int u = adj[0][i], comp;
    lvl[u] = 1;
    comp = dfs(u, head);
    a.push_back(BIT(comp));
    ++head;
  }
  mark[0] = 0;
  for (int q = 0; q < Q; q++) {
    int t;
    cin >> t;
    if (t == 0) {
      int v, x, d, pos;
      cin >> v >> x >> d;
      --v;
      pos = mark[v];
      if (v == 0) {
        rootAns += x;
        addInterVal(0, 1, d, x);
      } else {
        addInterVal(pos, max(1, lvl[v] - d), min(a[pos].size, lvl[v] + d), x);
        if (d >= lvl[v]) {
          rootAns += x;
          addInterVal(0, 1, d - lvl[v], x);
          addInterVal(pos, 1, d - lvl[v], -x);
        }
      }
    } else {
      int v, pos;
      cin >> v;
      --v;
      pos = mark[v];
      if (v == 0)
        cout << rootAns;
      else
        cout << a[pos].get(lvl[v]) + a[0].get(lvl[v]);
      cout << endl;
    }
  }
  return 0;
}
