#include <bits/stdc++.h>
using namespace std;
const int INF = 2147483647;
const int MAX = 100005;
struct BIT {
  int size;
  vector<int> arr;
  BIT(int s) {
    size = s;
    arr = vector<int>(s, 0);
  }
  void add(int pos, int val) {
    for (; pos < size; pos += pos & -pos) {
      arr[pos] += val;
    }
  }
  int sum(int pos) {
    int res = 0;
    for (; pos > 0; pos -= pos & -pos) {
      res += arr[pos];
    }
    return res;
  }
};
vector<vector<int> > v;
vector<int> adj[MAX];
pair<long long, long long> group[MAX];
vector<BIT> arr;
int main() {
  int n, q;
  cin >> n >> q;
  memset(adj, 0, sizeof(adj));
  int num = 0;
  for (int i = 0; i < n - 1; i++) {
    int a, b;
    cin >> a >> b;
    a--;
    b--;
    adj[a].push_back(b);
    adj[b].push_back(a);
  }
  group[0] = make_pair(0, 1);
  for (int i = 0; i < adj[0].size(); i++) {
    vector<int> v1;
    v1.push_back(0);
    int j = adj[0][i], last = 0;
    group[j] = make_pair(i + 1, 1);
    while (adj[j].size() == 2) {
      v1.push_back(adj[j][0] + adj[j][1] - j);
      int temp = j;
      j = adj[j][0] + adj[j][1] - last;
      last = temp;
      group[j] = make_pair(i + 1, v1.size());
    }
    v.push_back(v1);
  }
  BIT cen(MAX);
  arr.push_back(cen);
  for (int i = 1; i <= v.size(); i++) {
    BIT b(v[i - 1].size() + 5);
    arr.push_back(b);
  }
  for (int i = 0; i < q; i++) {
    int a;
    cin >> a;
    if (a == 0) {
      int b, c, d;
      cin >> b >> c >> d;
      b--;
      int x = group[b].first, y = group[b].second;
      if (x == 0) {
        arr[0].add(1, c);
        arr[0].add(min(MAX - 1, d + 2), -c);
      } else if (d >= y) {
        arr[x].add(min(arr[x].size - 1, d - y + 1), c);
        arr[x].add(min(arr[x].size - 1, y + d + 1), -c);
        arr[0].add(1, c);
        arr[0].add(min(MAX - 1, d - y + 2), -c);
      } else {
        arr[x].add(min(arr[x].size - 1, y - d), c);
        arr[x].add(min(arr[x].size - 1, y + d + 1), -c);
      }
    } else {
      int b;
      cin >> b;
      b--;
      int x = group[b].first, y = group[b].second;
      if (b == 0)
        cout << arr[0].sum(y) << endl;
      else
        cout << arr[0].sum(y + 1) + arr[x].sum(y) << endl;
    }
  }
}
