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;
inline int readint() {
  int a = 0;
  char c = getchar(), f = 1;
  for (; c < '0' || c > '9'; c = getchar())
    if (c == '-') f = -f;
  for (; '0' <= c && c <= '9'; c = getchar())
    a = (a << 3) + (a << 1) + (c ^ 48);
  return a * f;
}
inline void writeint(int x) {
  if (x > 9) writeint(x / 10);
  putchar((x % 10) ^ 48);
}
const int MaxN = 100005, infty = (1 << 30) - 1;
vector<int> g[MaxN], vis[MaxN];
int bel[MaxN], c[MaxN], dep[MaxN], n;
void build(int x, int fa) {
  vis[bel[x]].push_back(x);
  dep[x] = dep[fa] + 1;
  for (int i = 0, len = g[x].size(); i < len; ++i)
    if (g[x][i] != fa) {
      bel[g[x][i]] = bel[x];
      build(g[x][i], x);
    }
}
void add(int x, int v) {
  vector<int> &r = vis[bel[x]];
  int len = r.size();
  for (int i = dep[x]; i < len; i += (i & -i)) c[r[i]] += v;
}
int Sum(int x) {
  vector<int> &r = vis[bel[x]];
  int res = 0;
  for (int i = dep[x]; i; i -= (i & -i)) res += c[r[i]];
  return res;
}
int BIT[MaxN];
void modify(int d, int v) {
  for (int i = d; i <= n; i += (i & -i)) BIT[i] += v;
}
int query(int d) {
  int res = 0;
  for (int i = d; i; i -= (i & -i)) res += BIT[i];
  return res;
}
int main() {
  n = readint();
  int q = readint();
  for (int i = 1, a, b; i < n; ++i) {
    a = readint(), b = readint();
    g[a].push_back(b);
    g[b].push_back(a);
  }
  for (int i = 0, len = g[1].size(); i < len; ++i) {
    bel[g[1][i]] = g[1][i];
    vis[g[1][i]].push_back(1);
    build(g[1][i], 1);
  }
  while (q--) {
    int opt = readint();
    if (opt == 0) {
      int x = readint(), v = readint();
      int d = readint();
      unsigned t;
      if (dep[x] <= d) {
        t = d - dep[x] + 1, modify(t, -v);
        BIT[0] += v;
        if (x == 0) continue;
        if (t < vis[bel[x]].size()) add(vis[bel[x]][t], v);
      } else
        add(vis[bel[x]][dep[x] - d], v);
      t = dep[x] + d + 1;
      if (t < vis[bel[x]].size()) add(vis[bel[x]][t], -v);
    }
    if (opt == 1) {
      int x = readint();
      int res = query(dep[x]) + BIT[0];
      printf("%d\n", res + Sum(x));
    }
  }
  return 0;
}
