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.*;
import java.util.*;

public class A implements Runnable {

    private static final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;

    private BufferedReader in;
    private PrintWriter out;
    private StringTokenizer tok = new StringTokenizer("");

    private void init() throws FileNotFoundException {
        Locale.setDefault(Locale.US);
        String fileName = "";
        if (ONLINE_JUDGE && fileName.isEmpty()) {
            in = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
        } else {
            if (fileName.isEmpty()) {
                in = new BufferedReader(new FileReader("input.txt"));
                out = new PrintWriter("output.txt");
            } else {
                in = new BufferedReader(new FileReader(fileName + ".in"));
                out = new PrintWriter(fileName + ".out");
            }
        }
    }

    String readString() {
        while (!tok.hasMoreTokens()) {
            try {
                tok = new StringTokenizer(in.readLine());
            } catch (Exception e) {
                return null;
            }
        }
        return tok.nextToken();
    }

    int readInt() {
        return Integer.parseInt(readString());
    }

    long readLong() {
        return Long.parseLong(readString());
    }

    double readDouble() {
        return Double.parseDouble(readString());
    }

    int[] readIntArray(int size) {
        int[] a = new int[size];
        for (int i = 0; i < size; i++) {
            a[i] = readInt();
        }
        return a;
    }

    public static void main(String[] args) {
        //new Thread(null, new A(), "", 128 * (1L << 20)).start();
        new A().run();
    }

    long timeBegin, timeEnd;

    void time() {
        timeEnd = System.currentTimeMillis();
        System.err.println("Time = " + (timeEnd - timeBegin));
    }

    @Override
    public void run() {
        try {
            timeBegin = System.currentTimeMillis();
            init();
            solve();
            out.close();
            time();
        } catch (Exception e) {
            e.printStackTrace();
            System.exit(-1);
        }
    }

    class Pair {
        final long x, y;

        Pair(long x, long y) {
            this.x = x;
            this.y = y;
        }
    }

    int aiverson(boolean x) {
        return x ? 1 : 0;
    }

    Pair readPair() {
        return new Pair(readInt(), readInt());
    }

    int gcd(int a, int b) {
        return a == 0 ? b : gcd(b % a, a);
    }

    boolean cw(int x1, int y1, int x2, int y2, int x3, int y3) {
        return (x2 - x1) * (y3 - y1) - (x3 - x1) * (y2 - y1) < 0;
    }

    long getDistSqr(int x1, int y1, int x2, int y2) {
        long dx = x1 - x2;
        long dy = y1 - y2;
        return dx * dx + dy * dy;
    }

    final static int DEFAULT_EMPTY = -1;

    int[] idToRelaxedId;
    int curRelaxedId = 0;

    int getRelaxedId(int x) {
        if (idToRelaxedId[x] == DEFAULT_EMPTY) {
            idToRelaxedId[x] = curRelaxedId++;
        }
        return idToRelaxedId[x];
    }

    class SegmentTree {
        int[] sum;

        public SegmentTree(int size) {
            this.sum = new int[size * 4];
        }

        void add(int v, int tl, int tr, int l, int r, int delta) {
            if (l > r) return;
            if (tl == l && tr == r) {
                sum[v] += delta;
                return;
            }
            int mid = (tl + tr) >> 1;
            add(v << 1, tl, mid, l, Math.min(r, mid), delta);
            add((v << 1) + 1, mid + 1, tr, Math.max(mid + 1, l), r, delta);
        }

        int get(int v, int tl, int tr, int pos) {
            if (tl == tr)
                return sum[v];
            int mid = (tl + tr) >> 1;
            if (pos <= mid) {
                return sum[v] + get(v << 1, tl, mid, pos);
            } else {
                return sum[v] + get((v << 1) + 1, mid + 1, tr, pos);
            }
        }
    }

    private void solve() throws IOException {
        int n = readInt();
        int q = readInt();

        int[][] tempGraph = new int[2][n];
        Arrays.fill(tempGraph[0], DEFAULT_EMPTY);
        Arrays.fill(tempGraph[1], DEFAULT_EMPTY);
        int[] count = new int[n];
        List<Integer> rootBranchesBad = new ArrayList<>();
        for (int i = 0; i < n - 1; i++) {
            int x = readInt() - 1;
            int y = readInt() - 1;
            if (x == 0) {
                rootBranchesBad.add(y);
                tempGraph[count[y]++][y] = x;
                continue;
            }

            if (y == 0) {
                rootBranchesBad.add(x);
                tempGraph[count[x]++][x] = y;
                continue;
            }

            tempGraph[count[y]++][y] = x;
            tempGraph[count[x]++][x] = y;
        }
        idToRelaxedId = new int[n];
        Arrays.fill(idToRelaxedId, DEFAULT_EMPTY);

        int[] depth = new int[n];
        getRelaxedId(0);
        for (int to : rootBranchesBad) {
            relaxingDfs(to, 0, tempGraph, 1, depth);
        }

        this.depth = new int[n];
        for (int i = 0; i < n; i++) {
            this.depth[getRelaxedId(i)] = depth[i];
        }

        int[] rootBranches = new int[rootBranchesBad.size()];
        int id19 = 0;
        for (int to : rootBranchesBad) {
            rootBranches[id19++] = getRelaxedId(to);
        }

        int root = getRelaxedId(0);

        SegmentTree vertexesSegmentTree = new SegmentTree(n);
        SegmentTree depthSegmentTree = new SegmentTree(n);

        while (q-- > 0) {
            int type = readInt();
            if (type == 0) {
                int v = getRelaxedId(readInt() - 1);
                int delta = readInt();
                int d = readInt();

                if (v == root) {
                    depthSegmentTree.add(1, 0, n - 1, 0, d, delta);
                    continue;
                }

                int left = 0, right = rootBranches.length - 1;
                int branch = 0;
                while (left <= right) {
                    int mid = (left + right) >> 1;
                    if (rootBranches[mid] <= v) {
                        branch = mid;
                        left = mid + 1;
                    } else {
                        right = mid - 1;
                    }
                }
                int firstVertexInBranch = rootBranches[branch];
                int lastVertexInBranch = (branch == rootBranches.length - 1) ? (n - 1) : (rootBranches[branch + 1] - 1);

                int firstVertexInBottomQuery = Math.min(lastVertexInBranch, v + 1);
                int lastVertexInBottomQuery = Math.min(lastVertexInBranch, v + d);
                if (v != lastVertexInBranch) {
                    vertexesSegmentTree.add(1, 0, n - 1, firstVertexInBottomQuery, lastVertexInBottomQuery, delta);
                }

                int firstVertexInTopQuery = v - d;
                if (firstVertexInTopQuery >= firstVertexInBranch) {
                    vertexesSegmentTree.add(1, 0, n - 1, firstVertexInTopQuery, v, delta);
                } else {
                    int dForOtherBranches = d - (v - firstVertexInBranch + 1);
                    depthSegmentTree.add(1, 0, n - 1, 0, dForOtherBranches, delta);
                    int lastCoveredVertexInBranch = Math.min(lastVertexInBranch, firstVertexInBranch + dForOtherBranches - 1);
                    if (lastCoveredVertexInBranch < v) {
                        vertexesSegmentTree.add(1, 0, n - 1, lastCoveredVertexInBranch + 1, v, delta);
                    } else if (lastCoveredVertexInBranch > v) {
                        vertexesSegmentTree.add(1, 0, n - 1, v + 1, lastCoveredVertexInBranch, -delta);
                    }
                }
            } else {
                int v = getRelaxedId(readInt() - 1);
                out.println(vertexesSegmentTree.get(1, 0, n - 1, v) + depthSegmentTree.get(1, 0, n - 1, this.depth[v]));
            }
        }
    }

    int[] depth;

    void relaxingDfs(int v, int p, int[][] graph, int depth, int[] d) {
        getRelaxedId(v);
        d[v] = depth;
        while (true) {
            if (graph[0][v] != p && graph[0][v] != -1) {
                p = v;
                v = graph[0][v];
                d[v] = ++depth;
                getRelaxedId(v);
                continue;
            }
            if (graph[1][v] != p && graph[1][v] != -1) {
                p = v;
                v = graph[1][v];
                d[v] = ++depth;
                getRelaxedId(v);
                continue;
            }
            break;
        }
    }
}