#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100100;
struct segtree {
  int siz;
  vector<int> t;
  segtree() { siz = 0; }
  segtree(int k) {
    siz = 1;
    while (siz <= 2 * k + 1) {
      siz *= 2;
    }
    for (int i = 0; i < (siz); ++i) {
      t.push_back(0);
    }
    siz /= 2;
    for (int i = 0; i < ((int)t.size()); ++i) {
      t[i] = 0;
    }
  }
  void wloz(int a, int b, int c) {
    b = min(b, siz - 1);
    assert(b >= a);
    int l = a + siz;
    int p = b + siz;
    t[l] += c;
    if (p != l) t[p] += c;
    while (l / 2 != p / 2) {
      if (l % 2 == 0) {
        t[l + 1] += c;
      }
      if (p % 2 == 1) {
        t[p - 1] += c;
      }
      l /= 2;
      p /= 2;
    }
  }
  int daj(int v) {
    int res = 0;
    v += siz;
    while (v > 0) {
      res += t[v];
      v /= 2;
    }
    return res;
  }
};
vector<int> sas[MAXN];
int rzad[MAXN];
int kolumna[MAXN];
int ojc[MAXN];
int n, q;
void edgeIn(int a, int b) {
  sas[a].push_back(b);
  sas[b].push_back(a);
}
void readData() {
  scanf("%d", &n);
  scanf("%d", &q);
  int a, b;
  for (int i = 0; i < (n - 1); ++i) {
    scanf("%d%d", &a, &b);
    edgeIn(a, b);
  }
}
void bfs() {
  int start = 0;
  vector<int> bf;
  bf.push_back(1);
  ojc[1] = 1;
  for (int i = 0; i < ((int)bf.size()); ++i) {
    int obe = bf[i];
    int nei;
    for (int j = 0; j < ((int)sas[obe].size()); ++j) {
      nei = sas[obe][j];
      if (obe == 1) {
        kolumna[nei] = start;
        start++;
        rzad[nei] = 1;
        ojc[nei] = 1;
        bf.push_back(nei);
      } else if (ojc[nei] == 0) {
        ojc[nei] = obe;
        rzad[nei] = rzad[obe] + 1;
        kolumna[nei] = kolumna[obe];
        bf.push_back(nei);
      }
    }
  }
}
segtree tree[MAXN];
segtree general(MAXN);
void dodaj(int v, int x, int d) {
  int h = d - rzad[v];
  int kol = kolumna[v];
  if (h >= 0) {
    general.wloz(0, h, x);
    if (h + 1 <= tree[kol].siz - 2 && v != 1) {
      assert(rzad[v] + d >= h + 1);
      tree[kol].wloz(h + 1, rzad[v] + d, x);
    }
  } else {
    tree[kol].wloz(rzad[v] - d, rzad[v] + d, x);
  }
}
int wez(int v) { return general.daj(rzad[v]) + tree[kolumna[v]].daj(rzad[v]); }
int main() {
  readData();
  bfs();
  for (int i = 2; i <= (n); ++i) {
    if ((int)sas[i].size() == 1) {
      tree[kolumna[i]] = segtree(rzad[i] + 1);
    }
  }
  int sq, v, x, d;
  for (int i = 0; i < (q); ++i) {
    scanf("%d", &sq);
    if (sq == 0) {
      scanf("%d%d%d", &v, &x, &d);
      dodaj(v, x, d);
    } else {
      scanf("%d", &v);
      printf("%d\n", wez(v));
    }
  }
}
