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;
const int Maxn = 100 * 1000;
int n, m, segh[4 * Maxn + 5], h[Maxn + 10], indx[Maxn + 10], siz[Maxn + 10];
vector<int> adj[Maxn + 10], seg[Maxn + 10];
bool mark[Maxn + 10];
void dfs(int v, int ind) {
  mark[v] = true;
  indx[v] = ind;
  siz[ind]++;
  for (int i = 0; i < 4; i++) seg[ind].push_back(0);
  for (int i = 0; i < (int)adj[v].size(); i++)
    if (!mark[adj[v][i]]) h[adj[v][i]] = h[v] + 1, dfs(adj[v][i], ind);
  return;
}
void Up(int i, int s, int e, int ind, int s1, int e1, int num) {
  if (s1 == s && e1 == e) {
    seg[i][ind] += num;
    return;
  }
  int mid = (s + e) / 2;
  if (e1 <= mid) {
    Up(i, s, mid, 2 * ind + 1, s1, e1, num);
    return;
  }
  if (s1 >= mid) {
    Up(i, mid, e, 2 * ind + 2, s1, e1, num);
    return;
  }
  Up(i, s, mid, 2 * ind + 1, s1, mid, num),
      Up(i, mid, e, 2 * ind + 2, mid, e1, num);
  return;
}
void Uph(int s, int e, int ind, int s1, int e1, int num) {
  if (s == s1 && e == e1) {
    segh[ind] += num;
    return;
  }
  int mid = (s + e) / 2;
  if (e1 <= mid) {
    Uph(s, mid, 2 * ind + 1, s1, e1, num);
    return;
  }
  if (s1 >= mid) {
    Uph(mid, e, 2 * ind + 2, s1, e1, num);
    return;
  }
  Uph(s, mid, 2 * ind + 1, s1, mid, num),
      Uph(mid, e, 2 * ind + 2, mid, e1, num);
  return;
}
int getAns(int s, int e, int ind, int hh) {
  if (e == s + 1) return segh[ind];
  int mid = (s + e) / 2;
  if (hh < mid) return segh[ind] + getAns(s, mid, 2 * ind + 1, hh);
  return segh[ind] + getAns(mid, e, 2 * ind + 2, hh);
}
int getAns2(int i, int s, int e, int ind, int hh) {
  if (e == s + 1) return seg[i][ind];
  int mid = (s + e) / 2;
  if (hh < mid) return seg[i][ind] + getAns2(i, s, mid, 2 * ind + 1, hh);
  return seg[i][ind] + getAns2(i, mid, e, 2 * ind + 2, hh);
}
int main() {
  scanf("%d%d", &n, &m);
  int u, v;
  for (int i = 0; i < n - 1; i++) {
    scanf("%d%d", &u, &v);
    u--;
    v--;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  mark[0] = true;
  for (int i = 0; i < (int)adj[0].size(); i++)
    h[adj[0][i]] = 1, dfs(adj[0][i], i);
  int a, c, d;
  for (int i = 0; i < m; i++) {
    scanf("%d", &a);
    if (a == 0) {
      scanf("%d%d%d", &v, &c, &d);
      v--;
      int ind = indx[v];
      if (v == 0)
        Uph(0, n, 0, 0, min(d + 1, n), c);
      else {
        if (d >= h[v]) {
          Uph(0, n, 0, 0, d - h[v] + 1, c);
          if (d - h[v] < siz[ind])
            Up(ind, 0, siz[ind], 0, d - h[v], min(h[v] + d, siz[ind]), c);
        } else
          Up(ind, 0, siz[ind], 0, h[v] - d - 1, min(h[v] + d, siz[ind]), c);
      }
    } else {
      scanf("%d", &v);
      v--;
      if (v == 0)
        printf("%d\n", getAns(0, n, 0, 0));
      else {
        int ind = indx[v];
        printf("%d\n",
               getAns(0, n, 0, h[v]) + getAns2(ind, 0, siz[ind], 0, h[v] - 1));
      }
    }
  }
  return 0;
}
