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.util.List;
import java.util.Scanner;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.math.BigDecimal;
import java.io.BufferedWriter;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.Writer;
import java.util.LinkedList;
import java.math.BigInteger;
import java.io.InputStream;

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

class TaskE {
    private List[] adj;
    private int n;
    private int[][] chains;
    private int[][] binaryIndexTree;
    private int[] pos;
    private int[] id;
    private int value0;

    public void solve(int testNumber, InputReader in, OutputWriter out) {
        n = in.nextInt();
        int q = in.nextInt();
        pos = new int[n];
        id = new int[n];
        adj = new List[n];
        value0 = 0;

        for (int i = 0; i < n; ++i)
            adj[i] = new LinkedList<Integer>();

        for (int i = 1; i < n; ++i) {
            int u = in.nextInt() - 1;
            int v = in.nextInt() - 1;
            adj[u].add(v);
            adj[v].add(u);
        }

        initialize();

        while (q-- > 0) {
            int op = in.nextInt();
            int u = in.nextInt() - 1;
            if (op == 0) {
                int x = in.nextInt();
                int d = in.nextInt();
                if (u == 0) {
                    value0 += x;
                    add(binaryIndexTree[binaryIndexTree.length - 1], 1, x);
                    if (d + 1 < binaryIndexTree[binaryIndexTree.length - 1].length)
                        add(binaryIndexTree[binaryIndexTree.length - 1], d + 1, -x);
                } else {
                    int l = Math.max(1, pos[u] + 1 - d);
                    int r = Math.min(chains[id[u]].length, pos[u] + 1 + d);
                    if (l < binaryIndexTree[id[u]].length)
                        add(binaryIndexTree[id[u]], l, x);
                    if (r + 1 < binaryIndexTree[id[u]].length)
                        add(binaryIndexTree[id[u]], r + 1, -x);
                    int nd = d - (pos[u] + 1);
                    if (nd >= 0)
                        value0 += x;
                    if (nd > 0) {
                        add(binaryIndexTree[binaryIndexTree.length - 1], 1, x);
                        if (nd + 1 < binaryIndexTree[binaryIndexTree.length - 1].length)
                            add(binaryIndexTree[binaryIndexTree.length - 1], nd + 1, -x);
                        add(binaryIndexTree[id[u]], 1, -x);
                        if (nd + 1 < binaryIndexTree[id[u]].length)
                            add(binaryIndexTree[id[u]], nd + 1, x);
                    }
                }
            } else {
                int result;
                if (u == 0) {
                    result = value0;
                } else {
                    result = read(binaryIndexTree[id[u]], pos[u] + 1)
                            + read(binaryIndexTree[binaryIndexTree.length - 1], pos[u] + 1);
                }
                out.println(result);
            }
        }
    }

    private void add(int[] binaryIndexTree, int k, int v) {
        while (k < binaryIndexTree.length) {
            binaryIndexTree[k] += v;
            k += k & -k;
        }
    }

    private int read(int[] binaryIndexTree, int k) {
        int result = 0;
        while (k > 0) {
            result += binaryIndexTree[k];
            k -= k & -k;
        }
        return result;
    }

    private void initialize() {
        int current = 0;
        chains = new int[adj[0].size()][];
        binaryIndexTree = new int[adj[0].size() + 1][];
        binaryIndexTree[adj[0].size()] = new int[n + 1];
        for (int v : (List<Integer>) adj[0]) {
            List<Integer> list = getChain(v);
            chains[current] = new int[list.size()];
            int idx = 0;
            for (int element : list) {
                pos[element] = idx;
                id[element] = current;
                chains[current][idx] = element;
                ++idx;
            }
            binaryIndexTree[current] = new int[chains[current].length + 1];
            ++current;
        }
    }

    private List<Integer> getChain(int u) {
        List<Integer> result = new LinkedList<Integer>();
        result.add(u);
        int prev = 0;
        while (true) {
            int v = -1;
            for (int next : (List<Integer>) adj[u]) {
                if (next != prev) {
                    v = next;
                }
            }
            if (v == -1)
                break;
            prev = u;
            u = v;
            result.add(u);
        }
        return result;
    }
}

class InputReader {
    private Scanner scanner;

    public InputReader(InputStream inputStream) {
        scanner = new Scanner(new BufferedReader(new InputStreamReader(inputStream)));
    }

    public int nextInt() {
        return scanner.nextInt();
    }

    public long nextLong() {
        return scanner.nextLong();
    }

    public String next() {
        return scanner.next();
    }

    public BigInteger nextBigInteger() {
        return scanner.nextBigInteger();
    }

    public BigDecimal nextBigDecimal() {
        return scanner.nextBigDecimal();
    }

    public double nextDouble() {
        return scanner.nextDouble();
    }
}

class OutputWriter {
    private PrintWriter printWriter;

    public OutputWriter(OutputStream outputStream) {
        printWriter = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
    }

    public OutputWriter(Writer writer) {
        printWriter = new PrintWriter(writer);
    }

    public <T> void print(T object) {
        printWriter.print(object);
    }

    public <T> void println(T object) {
        printWriter.println(object);
    }

    public void println() {
        printWriter.println();
    }

    public void close() {
        printWriter.close();
    }
}
