#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
int dep[maxn], n, tt, bid[maxn], did[maxn];
int lowbit(int x) { return x & -x; }
struct bit {
  int board[maxn];
  void modify(int p, int v) {
    for (; p <= n; p += lowbit(p)) board[p] += v;
  }
  int query(int p) {
    int res = 0;
    for (; p; p -= lowbit(p)) res += board[p];
    return res;
  }
};
bit ta, tb;
struct node {
  int id, val;
  node(int x, int y) : id(x), val(y) {}
  bool operator<(const node& a) const { return val < a.val; }
};
vector<int> v[maxn];
vector<node> so;
int tod[maxn], bot[maxn];
int dfs(int x, int f, int d) {
  dep[x] = bot[x] = d;
  did[x] = ++tt;
  so.push_back(node(x, d));
  tod[d]++;
  for (int i = 0; i < v[x].size(); i++) {
    int toit = v[x][i];
    if (toit != f) bot[x] = dfs(toit, x, d + 1);
  }
  return bot[x];
}
void pre() {
  dfs(1, 0, 0);
  sort(so.begin(), so.end());
  for (int i = 0; i < n; i++) bid[so[i].id] = i + 1;
  for (int i = 1; i < n; i++) tod[i] += tod[i - 1];
}
int main() {
  int q, a, b, c, d;
  scanf("%d%d", &n, &q);
  for (int i = 1; i < n; i++) {
    scanf("%d%d", &a, &b);
    v[a].push_back(b);
    v[b].push_back(a);
  }
  pre();
  while (q--) {
    scanf("%d", &a);
    if (a == 1) {
      scanf("%d", &b);
      printf("%d\n", ta.query(did[b]) + tb.query(bid[b]));
    } else {
      scanf("%d%d%d", &b, &c, &d);
      if (dep[b] <= d) {
        tb.modify(1, c);
        tb.modify(tod[d - dep[b]] + 1, -c);
        int tp = dep[b] - (d - dep[b] + 1);
        int l = did[b] - tp, r = did[b] + min(d, bot[b] - dep[b]);
        if (l <= r) {
          ta.modify(l, c);
          ta.modify(r + 1, -c);
        }
      } else {
        int l = did[b] - d, r = did[b] + min(d, bot[b] - dep[b]);
        ta.modify(l, c);
        ta.modify(r + 1, -c);
      }
    }
  }
}
