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
import java.io.InputStreamReader;
import java.io.IOException;
import java.util.ArrayList;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 * @author vadimmm
 */
public class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskE solver = new TaskE();
		solver.solve(1, in, out);
		out.close();
	}
}

class TaskE {

    private int vertexCounter, requestCounter;
    private ArrayList<Integer>[] graph;
    private FenwickTree root;
    private FenwickTree[] chains;
    private int[] inChain, inChainPosition;

    public void solve(int testNumber, InputReader in, PrintWriter out) {
        vertexCounter = in.nextInt();
        requestCounter = in.nextInt();

        graph = new ArrayList[vertexCounter];
        for (int i = 0; i < vertexCounter; ++i)
            graph[i] = new ArrayList<Integer>();
        for (int i = 1; i < vertexCounter; ++i) {
            int v = in.nextInt() - 1;
            int u = in.nextInt() - 1;
            graph[v].add(u);
            graph[u].add(v);
        }

        inChain = new int[vertexCounter];
        inChainPosition = new int[vertexCounter];
        inChain[0] = inChainPosition[0] = -1;
        chains = new FenwickTree[graph[0].size()];
        root = new FenwickTree(vertexCounter);
        for (int current = 0; current < chains.length; ++current)
            chains[current] = new FenwickTree( dfs(graph[0].get(current), 0, current, 0) );

        for (int i = 0; i < requestCounter; ++i) {
            if (in.nextInt() == 0) {
                int vertex = in.nextInt() - 1;
                int value = in.nextInt();
                int distance = in.nextInt();
                if (inChainPosition[vertex] == -1) {
                    root.add(0, distance, value);
                } else if (distance < inChainPosition[vertex] + 1) {
                    chains[inChain[vertex]].add(inChainPosition[vertex] - distance, inChainPosition[vertex] + distance, value);
                } else {
                    int forAll = distance - inChainPosition[vertex] - 1;
                    root.add(0, forAll, value);
                    chains[inChain[vertex]].add(forAll, inChainPosition[vertex] + distance, value);
                }
            } else {
                int vertex = in.nextInt() - 1;
                if (inChain[vertex] == -1) {
                    out.println(root.getSum(0));
                } else {
                    int value = chains[inChain[vertex]].getSum(inChainPosition[vertex]) + root.getSum(inChainPosition[vertex] + 1);
                    out.println(value);
                }
            }
        }
    }

    private int dfs(int vertex, int parent, int chainIndex, int depth) {
        inChain[vertex] = chainIndex;
        inChainPosition[vertex] = depth;
        for (int v : graph[vertex])
            if (v != parent)
                return dfs(v, vertex, chainIndex, depth + 1);
        return depth + 1;
    }

    public class FenwickTree {

        private int[] t;

        public FenwickTree(int capacity) {
            t = new int[capacity];
        }

        private void add(int index, int delta) {
            while (index < t.length) {
                t[index] += delta;
                index |= index + 1;
            }
        }

        public void add(int left, int right, int delta) {
            right = Math.min(right, t.length - 1);
            add(left, delta);
            add(right + 1, -delta);
        }

        public int getSum(int index) {
            int sum = 0;
            while (index >= 0) {
                sum += t[index];
                index = (index & (index + 1)) - 1;
            }
            return sum;
        }

    }

}

class InputReader {

    private static BufferedReader bufferedReader;
    private static StringTokenizer stringTokenizer;

    public InputReader(InputStream inputStream) {
        bufferedReader = new BufferedReader(new InputStreamReader(inputStream));
        stringTokenizer = null;
    }

    public String next() {
        while(stringTokenizer == null || !stringTokenizer.hasMoreTokens()) {
            try {
                stringTokenizer = new StringTokenizer(bufferedReader.readLine());
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        return stringTokenizer.nextToken();
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

    }

