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;
int n, q;
int chSize[100010];
vector<int> G[100010], ch[100010];
vector<int> vc;
void updateCh(int id, int pos, int del) {
  int BOUND = ch[id].size();
  while (pos < BOUND) {
    ch[id][pos] += del;
    pos += pos & (-pos);
  }
}
int getSumCh(int id, int pos) {
  int ret = 0;
  while (pos > 0) {
    ret += ch[id][pos];
    pos -= pos & (-pos);
  }
  return ret;
}
void update(int pos, int del) {
  int BOUND = vc.size();
  while (pos < BOUND) {
    vc[pos] += del;
    pos += pos & (-pos);
  }
}
int getSum(int pos) {
  int ret = 0;
  while (pos > 0) {
    ret += vc[pos];
    pos -= pos & (-pos);
  }
  return ret;
}
int dep[100010], id[100010];
bool vis[100010];
void prePro() {
  memset(vis, false, sizeof(vis));
  dep[1] = 1;
  vis[1] = true;
  stack<int> stk;
  for (int i = 0, sz = G[1].size(); i < sz; i++) {
    dep[G[1][i]] = 2;
    id[G[1][i]] = i;
    chSize[i] = 1;
    vis[G[1][i]] = true;
    stk.push(G[1][i]);
  }
  while (!stk.empty()) {
    int cur = stk.top();
    stk.pop();
    for (int i = 0, sz = G[cur].size(); i < sz; i++) {
      if (!vis[G[cur][i]]) {
        dep[G[cur][i]] = dep[cur] + 1;
        id[G[cur][i]] = id[cur];
        chSize[id[cur]]++;
        vis[G[cur][i]] = true;
        stk.push(G[cur][i]);
      }
    }
  }
  int lgest = -1;
  for (int i = 0, sz = G[1].size(); i < sz; i++) {
    ch[i].resize(chSize[i] + 10);
    lgest = ((lgest) > (chSize[i]) ? (lgest) : (chSize[i]));
  }
  vc.resize(lgest + 10);
}
int main() {
  scanf("%d%d", &n, &q);
  for (int i = 1; i < n; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    G[u].push_back(v);
    G[v].push_back(u);
  }
  prePro();
  while (q--) {
    int opt;
    scanf("%d", &opt);
    if (opt == 0) {
      int v, x, d;
      scanf("%d%d%d", &v, &x, &d);
      if (v == 1) {
        update(1, x);
        update(d + 2, -x);
      } else {
        int l = dep[v] - d, r = dep[v] + d + 1;
        if (l < 1) {
          update(1, x);
          update(d - dep[v] + 3, -x);
          l = d - dep[v] + 3;
        }
        updateCh(id[v], l, x);
        updateCh(id[v], r, -x);
      }
    } else {
      int v;
      scanf("%d", &v);
      int num = getSum(dep[v]);
      if (v == 1) {
        for (int i = 0, sz = G[1].size(); i < sz; i++) num += getSumCh(i, 1);
      } else
        num += getSumCh(id[v], dep[v]);
      printf("%d\n", num);
    }
  }
  return 0;
}
