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
/**
 * Created with IntelliJ IDEA.
 * User: brzezinsky
 * Date: 12/16/12
 * Time: 7:44 PM
 * To change this template use File | Settings | File Templates.
 */


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

public class E extends Thread {
    public E(String inputFileName, String outputFileName) {
        try {
            if (inputFileName != null) {
                this.input = new BufferedReader(new FileReader(inputFileName));
            } else {
                this.input = new BufferedReader(new InputStreamReader(System.in));
            }
            if (outputFileName != null) {
                this.output = new PrintWriter(outputFileName);
            } else {
                this.output = new PrintWriter(System.out);
            }
            this.setPriority(Thread.MAX_PRIORITY);
        } catch (Throwable e) {
            System.err.println(e.getMessage());
            e.printStackTrace();
            System.exit(666);
        }
    }

    static class Tree {
        int []t;
        int n;
        public Tree(int n) {
            this.n = n;
            t = new int[n << 2];
        }

        void update(int l ,int r, int add) {
            update(1, 0, n - 1, l, r, add);
        }

        int get(int pos) {
            return get(1, 0, n - 1, pos);
        }

        void update (int v, int tl, int tr, int l, int r, int add) {
            if (l > r)
                return;
            if (l == tl && tr == r)
                t[v] += add;
            else {
                int tm = (tl + tr) / 2;
                update (v*2, tl, tm, l, Math.min(r, tm), add);
                update (v*2+1, tm+1, tr, Math.max(l, tm + 1), r, add);
            }
        }

        int get (int v, int tl, int tr, int pos) {
            if (tl == tr)
                return t[v];
            int tm = (tl + tr) / 2;
            if (pos <= tm)
                return t[v] + get (v*2, tl, tm, pos);
            else
                return t[v] + get (v*2+1, tm+1, tr, pos);
        }
    }

    ArrayList<Integer> g[];
    ArrayList<Integer> sizes = new ArrayList<Integer>();
    boolean []used;
    int []pathAt;
    int []pathID;
    int curPath, curId;

    void dfs(int v) {
        if (used[v]) return;
        used[v] = true;
        pathID[v] = curId++;
        pathAt[v] = curPath;
        for (int to : g[v]) dfs(to);
    }



    private void solve() throws Throwable {
        int n = nextInt();
        int q = nextInt();
        g = new ArrayList[n];
        used = new boolean[n];
        used[0] = true;
        for (int i = 0; i < n; ++i) g[i] = new ArrayList<Integer>();
        for (int i = 0; i + 1 < n; ++i) {
            int a = nextInt() - 1;
            int b = nextInt() - 1;
            g[a].add(b);
            g[b].add(a);

        }
        pathAt = new int[n];
        pathID = new int[n];
        int zeroADD = 0;
        curPath = 0;
        for (int t : g[0]) {
            curId = 0;
            dfs(t);
            ++curPath;
            sizes.add(curId);
        }
        Tree []paths = new Tree[curPath];
        int maxSize = 0;
        for (int i = 0; i < curPath; ++i) {
            paths[i] = new Tree(sizes.get(i));
            maxSize = Math.max(sizes.get(i), maxSize);
        }
        Tree global = new Tree(maxSize);
        for (int qID = 0; qID < q; ++qID) {
            int type = nextInt(), v = nextInt() - 1;
            if (type == 0) {
                int x = nextInt(), d = nextInt();
                if (v == 0) {
                    zeroADD += x;
                    --d;
                    global.update(0, Math.min(d, maxSize - 1), x);
                } else {
                    curPath = pathAt[v];
                    curId = pathID[v];
                    int left = curId - d;
                    int right = Math.min(sizes.get(curPath) - 1, curId + d);
                    if (left < 0) {
                        zeroADD += x;
                        left = -left - 1;
                        if (left >= 1) global.update(0, Math.min(left - 1, maxSize - 1), x);
                    }
                    if (left <= right)
                        paths[curPath].update(left, right, x);

                }
            } else {
                if (v == 0) {
                    output.println(zeroADD);
                } else {
                    curPath = pathAt[v];
                    curId = pathID[v];
                    output.println(paths[curPath].get(curId) + global.get(curId));
                }
            }
        }
    }



    public void run() {
        try {
            solve();
        } catch (Throwable e) {
            System.err.println(e.getMessage());
            e.printStackTrace();
            System.exit(666);
        } finally {
            output.close();
        }
    }

    public static void main(String... args) {
        new E(null, null).start();
    }

    private int nextInt() throws IOException {
        return Integer.parseInt(next());
    }

    private double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }

    private long nextLong() throws IOException {
        return Long.parseLong(next());
    }

    private String next() throws IOException {
        while (tokens == null || !tokens.hasMoreTokens()) {
            tokens = new StringTokenizer(input.readLine());
        }
        return tokens.nextToken();
    }

    private StringTokenizer tokens;
    private BufferedReader input;
    private PrintWriter output;
}