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>
#pragma comment(linker, "/stack:20111000")
using namespace std;
deque<deque<int>> branches;
deque<int>* verticies;
pair<int, int>* vertexInfo;
int n, q;
struct fenwick {
  int* arr;
  int count;
};
inline int f(int value) { return value - (value & (value - 1)); }
int max(int a, int b) { return a > b ? a : b; }
void addValue(fenwick* tree, int pos, int value) {
  while (pos <= tree->count) {
    tree->arr[pos] += value;
    pos += f(pos);
  }
}
int getSum(fenwick* tree, int pos) {
  int result = 0;
  while (pos > 0) {
    result += tree->arr[pos];
    pos -= f(pos);
  }
  return result;
}
fenwick* generateTree(int count) {
  fenwick* result = new fenwick;
  int k = 1;
  while (k < count) k <<= 1;
  result->arr = new int[k + 1];
  memset(result->arr, 0, sizeof(int) * (k + 1));
  result->count = k;
  return result;
}
bool* visited;
int currentLine;
void dfsVisit(int v);
void dfs() {
  visited = new bool[n + 1];
  memset(visited, false, sizeof(bool) * (n + 1));
  visited[1] = true;
  currentLine = 0;
  branches.push_back(deque<int>());
  for (int i = 0; i < (verticies[1].size()); i++) {
    if (!visited[verticies[1][i]]) {
      currentLine++;
      branches.push_back(deque<int>());
      dfsVisit(verticies[1][i]);
    }
  }
}
void dfsVisit(int vertex) {
  visited[vertex] = true;
  for (int i = 0; i < (verticies[vertex].size()); i++) {
    if (!visited[verticies[vertex][i]]) {
      dfsVisit(verticies[vertex][i]);
    }
  }
  branches[currentLine].push_front(vertex);
}
int main() {
  int QWE;
  QWE = 1;
  for (int T = 0; T < QWE; T++) {
    scanf("%d %d", &n, &q);
    verticies = new deque<int>[n + 1];
    vertexInfo = new pair<int, int>[n + 1];
    for (int i = 1; i < n; i++) {
      int from, to;
      scanf("%d %d", &from, &to);
      verticies[from].push_back(to);
      verticies[to].push_back(from);
    }
    dfs();
    deque<fenwick*> trees;
    int maximalDeep = -1;
    for (int i = 1; i <= currentLine; i++) {
      maximalDeep = max(maximalDeep, (branches[i].size()));
      trees.push_back(generateTree((branches[i].size())));
      for (int j = 0; j < (branches[i].size()); j++) {
        vertexInfo[branches[i][j]].first = i;
        vertexInfo[branches[i][j]].second = j + 1;
      }
    }
    fenwick* global = generateTree(maximalDeep + 1);
    for (int i = 0; i < q; i++) {
      int action;
      scanf("%d ", &action);
      switch (action) {
        case 0: {
          int vertex, x, d;
          scanf("%d %d %d\n", &vertex, &x, &d);
          int index = vertexInfo[vertex].second;
          int low = index - d;
          int high = index + d;
          if (vertex == 1) {
            addValue(global, 1, x);
            if (d + 1 < maximalDeep + 1) addValue(global, d + 2, -x);
            break;
          }
          if (low > 0) {
            addValue(trees[vertexInfo[vertex].first - 1], low, x);
            if (high < (branches[vertexInfo[vertex].first].size())) {
              addValue(trees[vertexInfo[vertex].first - 1], high + 1, -x);
            }
            break;
          }
          int layer = -low + 1;
          addValue(global, 1, x);
          if (layer < maximalDeep + 1) addValue(global, layer + 1, -x);
          if (layer <= high) {
            low = layer;
            addValue(trees[vertexInfo[vertex].first - 1], low, x);
            if (high < (branches[vertexInfo[vertex].first].size())) {
              addValue(trees[vertexInfo[vertex].first - 1], high + 1, -x);
            }
          }
          break;
        }
        case 1: {
          int vertex;
          scanf("%d\n", &vertex);
          if (vertex == 1) {
            printf("%d\n", getSum(global, 1));
          } else {
            printf("%d\n", getSum(global, vertexInfo[vertex].second + 1) +
                               getSum(trees[vertexInfo[vertex].first - 1],
                                      vertexInfo[vertex].second));
          }
          break;
        }
      }
    }
    branches.clear();
  }
  return 0;
}
