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
/*
Keep solving problems. 
*/

import java.util.*;
import java.io.*;

public class CFA {

    BufferedReader br;
    PrintWriter out;
    StringTokenizer st;
    boolean eof;
    final long MOD = 1000L * 1000L * 1000L + 7;
    int[] dx = {1, 2, 1, 1};
    int[] dy = {0, 0, -1, 1};

    List<List<Integer>> graph = new ArrayList<>();
    long[][] tree;
    int[] depth;
    int[] sz;
    int[] id;

    /**
     * Increment elements within range [queryStartIndex, queryEndIndex] with value
     */
    void update_tree(int node, int nodeStartIndex, int nodeEndIndex, int queryIndex, int value, int treeIndex) {
        if(nodeStartIndex > nodeEndIndex || nodeStartIndex > nodeEndIndex || nodeStartIndex > queryIndex || nodeEndIndex < queryIndex) // Current segment is not within range [i, j]
            return;
        if(nodeStartIndex >= queryIndex && nodeEndIndex <= queryIndex) { // Segment is fully within range
            tree[treeIndex][node] += value;
            return;
        }

        update_tree(node * 2, nodeStartIndex, (nodeStartIndex + nodeEndIndex) / 2, queryIndex, value, treeIndex); // Updating left child
        update_tree(node * 2 + 1, 1 + (nodeStartIndex + nodeEndIndex) / 2, nodeEndIndex, queryIndex, value, treeIndex); // Updating right child

        tree[treeIndex][node] = tree[treeIndex][node * 2] + tree[treeIndex][node * 2 + 1]; // Updating root
    }

    /**
     * Query tree to get max element value within range [queryStartIndex, queryEndIndex]
     */
    long query_tree(int node, int nodeStartIndex, int nodeEndIndex, int queryStartIndex, int queryEndIndex, int treeIndex) {
        if(nodeStartIndex > nodeEndIndex || nodeStartIndex > queryEndIndex || nodeEndIndex < queryStartIndex) return 0; // Out of range
        if(nodeStartIndex >= queryStartIndex && nodeEndIndex <= queryEndIndex) // Current segment is totally within range [i, j]
            return tree[treeIndex][node];

        long q1 = query_tree(node * 2, nodeStartIndex, (nodeStartIndex + nodeEndIndex) / 2, queryStartIndex, queryEndIndex, treeIndex); // Query left child
        long q2 = query_tree(1 + node * 2, 1 + (nodeStartIndex + nodeEndIndex) / 2, nodeEndIndex, queryStartIndex, queryEndIndex, treeIndex); // Query right child

        return q1 + q2;
    }

    void solve() throws IOException {
        int n = nextInt();
        int q = nextInt();
        for (int i = 0; i < n; i++) {
            graph.add(new ArrayList<>());
        }
        sz = new int[n];
        depth = new int[n];
        id = new int[n];
        for (int i = 0; i < n - 1; i++) {
            int u = nextInt() - 1;
            int v = nextInt() - 1;
            graph.get(u).add(v);
            graph.get(v).add(u);
        }

        for (int i = 0; i < graph.get(0).size(); i++) {
            int v = graph.get(0).get(i);
            dfs(v, 0, 1, i);
        }

        tree = new long[graph.get(0).size() + 1][];
        for (int i = 0; i < graph.get(0).size(); i++) {
            int len = sz[id[graph.get(0).get(i)]] * 5;
            tree[i] = new long[len];
        }
        tree[tree.length - 1] = new long[n * 5];

        long rootValue = 0;
        List<Long> res = new ArrayList<>();
        for (int c = 0; c < q; c++) {
            int t = nextInt();
            if (t == 0) {
                int v = nextInt() - 1;
                int x = nextInt();
                int d = nextInt();

                if (v == 0) {
                    rootValue += x;
                    update_tree(1, 0, n - 1, 0, x, tree.length - 1);
                    update_tree(1, 0, n - 1, d, -x, tree.length - 1);
                }
                else {
                    if (d >= depth[v]) {
                        int left = d - depth[v];
                        rootValue += x;
                        update_tree(1, 0, n - 1, 0, x, tree.length - 1);
                        update_tree(1, 0, n - 1, left, -x, tree.length - 1);

                        int upp = Math.min(left, sz[id[v]]);
                        update_tree(1, 0, sz[id[v]] - 1, upp, x, id[v]);
                        upp = Math.min(depth[v] + d, sz[id[v]]);
                        update_tree(1, 0, sz[id[v]] - 1, upp, -x, id[v]);
                    }
                    else {
                        int low = Math.max(depth[v] - d - 1, 0);
                        int upp = Math.min(depth[v] + d, sz[id[v]]);
                        update_tree(1, 0, sz[id[v]] - 1, low, x, id[v]);
                        update_tree(1, 0, sz[id[v]] - 1, upp, -x, id[v]);
                    }
                }
            }
            else {
                int v = nextInt() - 1;
                if (v == 0) {
                    res.add(rootValue);
                }
                else {
                    int upp = Math.min(sz[id[v]], depth[v] - 1);
                    long v1 = query_tree(1, 0, sz[id[v]] - 1, 0, upp, id[v]);
                    long v2 = query_tree(1, 0, n - 1, 0, depth[v] - 1, tree.length - 1);
                    res.add(v1 + v2);
                }
            }
        }

        for (int i = 0; i < res.size(); i++) {
            outln(res.get(i));
        }
    }

    void dfs(int cur, int parent, int dep, int i) {
        depth[cur] = dep;
        id[cur] = i;
        sz[i]++;
        for (int nxt : graph.get(cur)) {
            if (nxt == parent) {
                continue;
            }
            dfs(nxt, cur, dep + 1, i);
        }
    }

    void shuffle(int[] a) {
        int n = a.length;
        for(int i = 0; i < n; i++) {
            int r = i + (int) (Math.random() * (n - i));
            int tmp = a[i];
            a[i] = a[r];
            a[r] = tmp;
        }
    }

    long gcd(long a, long b) {
        while(a != 0 && b != 0) {
            long c = b;
            b = a % b;
            a = c;
        }
        return a + b;
    }

    private void outln(Object o) {
        out.println(o);
    }
    private void out(Object o) {
        out.print(o);
    }
    public CFA() throws IOException {
        br = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(System.out);
        solve();
        out.close();
    }
    public static void main(String[] args) throws IOException {
        new CFA();
    }

    public long[] nextLongArr(int n) throws IOException{
        long[] res = new long[n];
        for(int i = 0; i < n; i++)
            res[i] = nextLong();
        return res;
    }
    public int[] nextIntArr(int n) throws IOException {
        int[] res = new int[n];
        for(int i = 0; i < n; i++)
            res[i] = nextInt();
        return res;
    }
    public String nextToken() {
        while (st == null || !st.hasMoreTokens()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (Exception e) {
                eof = true;
                return null;
            }
        }
        return st.nextToken();
    }
    public String nextString() {
        try {
            return br.readLine();
        } catch (IOException e) {
            eof = true;
            return null;
        }
    }
    public int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }
    public long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }
    public double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }
}

