#include <bits/stdc++.h>
using namespace std;
typedef long double real;
struct Node {
  int l, r, m;
  int val;
  Node *lson, *rson;
  Node(int l, int r) : l(l), r(r), m((l + r) >> 1), val(0), lson(0), rson(0) {
    if (l == r) {
      return;
    }
    lson = new Node(l, m);
    rson = new Node(m + 1, r);
  }
  ~Node() {
    if (lson) {
      delete lson;
      delete rson;
    }
  }
  void push() {
    if (!lson) {
      return;
    }
    lson->val += val;
    rson->val += val;
    val = 0;
  }
  void add(int tl, int tr, int x) {
    if (r < tl || l > tr) {
      return;
    }
    if (tl <= l && r <= tr) {
      val += x;
      return;
    }
    push();
    lson->add(tl, tr, x);
    rson->add(tl, tr, x);
  }
  int get(int ind) {
    if (l == r) {
      return val;
    }
    push();
    if (ind < m + 1) {
      return lson->get(ind);
    } else {
      return rson->get(ind);
    }
  }
};
int n, q;
int depth[100001], color[100001], maxd[100001];
Node *tree[100001];
Node *dtree;
bool used[100001];
vector<int> G[100001];
void dfs(int v, int clr, int d) {
  used[v] = true;
  for (int i = 0; i < G[v].size(); ++i) {
    int to = G[v][i];
    if (used[to]) {
      continue;
    }
    dfs(to, clr, d + 1);
  }
  depth[v] = d;
  color[v] = clr;
  maxd[clr] = max(maxd[clr], d);
}
int main() {
  scanf("%d %d", &n, &q);
  for (int i = 0; i < n - 1; ++i) {
    int u, v;
    scanf("%d %d", &u, &v);
    G[u].push_back(v);
    G[v].push_back(u);
  }
  used[1] = true;
  int _maxd = 0;
  for (int i = 0; i < G[1].size(); ++i) {
    dfs(G[1][i], i, 1);
    _maxd = max(_maxd, maxd[i]);
    tree[i] = new Node(1, maxd[i]);
  }
  dtree = new Node(0, _maxd);
  while (q--) {
    int t;
    scanf("%d", &t);
    if (t) {
      int v;
      scanf("%d", &v);
      int ans = dtree->get(depth[v]);
      if (v > 1) {
        ans += tree[color[v]]->get(depth[v]);
      }
      printf("%d\n", ans);
    } else {
      int v, x, d;
      scanf("%d %d %d", &v, &x, &d);
      int r = min(maxd[color[v]], depth[v] + d);
      if (d < depth[v]) {
        int l = depth[v] - d;
        tree[color[v]]->add(l, r, x);
      } else {
        int rd = d - depth[v];
        dtree->add(0, rd, x);
        int l = rd + 1;
        if (l <= r) {
          tree[color[v]]->add(l, r, x);
        }
      }
    }
  }
}
