A little girl loves problems on trees very much. Here's one of them.

A tree is an undirected connected graph, not containing cycles. The degree of node x in the tree is the number of nodes y of the tree, such that each of them is connected with node x by some edge of the tree. 

Let's consider a tree that consists of n nodes. We'll consider the tree's nodes indexed from 1 to n. The cosidered tree has the following property: each node except for node number 1 has the degree of at most 2.

Initially, each node of the tree contains number 0. Your task is to quickly process the requests of two types:

  * Request of form: 0 v x d. In reply to the request you should add x to all numbers that are written in the nodes that are located at the distance of at most d from node v. The distance between two nodes is the number of edges on the shortest path between them. 
  * Request of form: 1 v. In reply to the request you should print the current number that is written in node v. 

Input

The first line contains integers n (2 ≤ n ≤ 105) and q (1 ≤ q ≤ 105) — the number of tree nodes and the number of requests, correspondingly.

Each of the next n - 1 lines contains two integers ui and vi (1 ≤ ui, vi ≤ n, ui ≠ vi), that show that there is an edge between nodes ui and vi. Each edge's description occurs in the input exactly once. It is guaranteed that the given graph is a tree that has the property that is described in the statement.

Next q lines describe the requests.

  * The request to add has the following format: 0 v x d (1 ≤ v ≤ n, 1 ≤ x ≤ 104, 1 ≤ d < n). 
  * The request to print the node value has the following format: 1 v (1 ≤ v ≤ n). 



The numbers in the lines are separated by single spaces.

Output

For each request to print the node value print an integer — the reply to the request.

Examples

Input

3 6
1 2
1 3
0 3 1 2
0 2 3 1
0 1 5 2
1 1
1 2
1 3


Output

9
9
6


Input

6 11
1 2
2 5
5 4
1 6
1 3
0 3 1 3
0 3 4 5
0 2 1 4
0 1 5 5
0 4 6 2
1 1
1 2
1 3
1 4
1 5
1 6


Output

11
17
11
16
17
11
#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);
        }
      }
    }
  }
}
