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

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
/**
 *
 * @author Trung Pham
 */
public class E {

    public static void main(String[] args) {
        Scanner in = new Scanner();
        PrintWriter out = new PrintWriter(System.out);
        int n = in.nextInt();
        int q = in.nextInt();
        Node[] ns = new Node[n];
        for (int i = 0; i < n; i++) {
            ns[i] = new Node(i);
        }
        for (int i = 0; i < n - 1; i++) {
            int a = in.nextInt() - 1;
            int b = in.nextInt() - 1;
            //System.out.println("Test " + a + " " + b);
            ns[a].child.add(ns[b]);
            ns[b].child.add(ns[a]);
        }
        FWTree[] ts = new FWTree[ns[0].child.size()];
        for (int i = 0; i < ns[0].child.size(); i++) {
            Node node = ns[0].child.get(i);
            int depth = DFS(node, 0, 1, i);
            ts[i] = new FWTree(depth);
        }
        int root = 0;
        //     System.out.println("Q " + q);        
        FWTree rt = new FWTree(n);
        for (int i = 0; i < q; i++) {
            int type = in.nextInt();

            if (type == 0) {
                int v = in.nextInt() - 1;
                int x = in.nextInt();
                int d = in.nextInt();
                if (v == 0) {
                    rt.update(1, x);
                    rt.update(d + 1, -x);
                    root += x;
                } else {
                    Node node = ns[v];
                    if (node.depth > d) {
                        ts[node.chain].update(node.depth - d, x);
                        ts[node.chain].update(node.depth + d + 1, -x);
                    } else if (node.depth < d) {
                        int d1 = d - node.depth;
                        /*Need to update that whole branch, update locally the bottom half first*/
                        ts[node.chain].update(d1 + 1, x);
                        ts[node.chain].update(node.depth + d + 1, -x);
                        /*This will take care of the top half of the tree*/
                        rt.update(1, x);
                        rt.update(d1 + 1, -x);
                        root += x;
                    } else if (node.depth == d) {
                        root += x;
                        ts[node.chain].update(1, x);
                        ts[node.chain].update(node.depth + d + 1, -x);
                    }
                }
            } else {
                int v = in.nextInt() - 1;
                Node node = ns[v];
                if (v == 0) {
                    out.println(root);
                } else {
                    int val = ts[node.chain].get(node.depth);
                    val += rt.get(node.depth);
                    out.println(val);
                }
            }

        }
        out.flush();
        //System.out.print(builder.toString());
    }

    public static int DFS(Node node, int parent, int depth, int chain) {

        //    int result = depth;
        while (node != null) {
            node.depth = depth++;
            node.chain = chain;
            Node next = null;
            for (int i = 0; i < node.child.size(); i++) {
                if (node.child.get(i).id != parent) {
                    next = node.child.get(i);
                    break;
                }
            }
            parent = node.id;
            node = next;
        }
        return depth;
    }

    static class FWTree {

        int[] tree;

        FWTree(int size) {
            tree = new int[size + 1];
        }

        public void update(int index, int val) {
            if (index == 0) {
                return;
            }
            while (index < tree.length) {
                tree[index] += val;
                index += index & (-index);
            }
        }

        public int get(int index) {
            int result = 0;
            while (index > 0) {
                result += tree[index];
                index -= index & (-index);
            }
            return result;
        }
    }

    static class Node {

        int id;
        ArrayList<Node> child = new ArrayList();
        int depth;
        int chain;

        Node(int node) {
            id = node;
        }
    }

    static class Scanner {

        BufferedReader br;
        StringTokenizer st;

        public Scanner() {
            // System.setOut(new PrintStream(new BufferedOutputStream(System.out), true));
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        public String next() {

            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (Exception e) {
                    throw new RuntimeException();
                }
            }
            return st.nextToken();
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

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

        public double nextDouble() {
            return Double.parseDouble(next());
        }

        public String nextLine() {
            st = null;
            try {
                return br.readLine();
            } catch (Exception e) {
                throw new RuntimeException();
            }
        }

        public boolean endLine() {
            try {
                String next = br.readLine();
                while (next != null && next.trim().isEmpty()) {
                    next = br.readLine();
                }
                if (next == null) {
                    return true;
                }
                st = new StringTokenizer(next);
                return st.hasMoreTokens();
            } catch (Exception e) {
                throw new RuntimeException();
            }
        }
    }
}