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.*;
import java.io.*;
import java.math.*;
import java.awt.geom.*;

import static java.lang.Math.*;

public class Solution implements Runnable {
    
    class SegmentTree {
        
        int n;
        int[] t;
        
        public SegmentTree(int n) {
            this.n = n;
            t = new int[4 * n + 1];
        }
        
        int get(int v, int tl, int tr, int l, int r) {
            if (l > r) {
                return 0;
            } else if (l == tl && r == tr) {
                return t[v];
            } else {
                int tm = (tl + tr) / 2;
                int val1 = get(2 * v + 1, tl, tm, l, min(tm, r));
                int val2 = get(2 * v + 2, tm + 1, tr, max(tm + 1, l), r);
                return val1 + val2 + t[v];
            }
        }
        
        int get(int l, int r) {
            return get(0, 0, n - 1, l, r);
        }
        
        void add(int v, int tl, int tr, int l, int r, int val) {
            if (l > r) {
                return;
            } else if (l == tl && r == tr) {
                t[v] += val;
            } else {
                int tm = (tl + tr) / 2;
                add(2 * v + 1, tl, tm, l, min(tm, r), val);
                add(2 * v + 2, tm + 1, tr, max(tm + 1, l), r, val);
            }
        }
        
        void add(int l, int r, int val) {
            add(0, 0, n - 1, l, r, val);
        }
        
    }
    
    int val0 = 0;
    ArrayList<Integer>[] g;
    SegmentTree all;
    SegmentTree[] t;
    int[] pos;
    
    SegmentTree dfs(int v, int from, int p) {
        if (g[v].size() == 1) {
            SegmentTree tree = new SegmentTree(p + 1); 
            t[v] = tree;
            pos[v] = p;
            return tree;
        }
        for (int e : g[v]) {
            if (e == from) {
                continue;
            } else {
                SegmentTree tree = dfs(e, v, p + 1); 
                t[v] = tree;
                pos[v] = p;
                return tree;
            }
        }
        throw new RuntimeException();
    }
    
    public void solve() throws Exception {
        int n = sc.nextInt(), q = sc.nextInt();
        g = new ArrayList[n];
        for (int i = 0; i < n; i++) {
            g[i] = new ArrayList<Integer>();
        }
        for (int i = 0; i < n - 1; i++) {
            int u = sc.nextInt() - 1, v = sc.nextInt() - 1;
            g[u].add(v);
            g[v].add(u);
        }
        t = new SegmentTree[n];
        pos = new int[n];
        for (int v : g[0]) {
            dfs(v, 0, 0);
        }
        all = new SegmentTree(n);
        for (int i = 0; i < q; i++) {
            int type = sc.nextInt();
            if (type == 0) {
                int v = sc.nextInt() - 1, x = sc.nextInt(), d = sc.nextInt();
                if (v == 0) {
                    val0 += x;
                    if (d > 0) {
                        all.add(0, d - 1, x);
                    }
                } else if (d <= pos[v]) {
                    int l = pos[v] - d;
                    int r = min(t[v].n - 1, pos[v] + d);
                    t[v].add(l, r, x);
                } else {
                    val0 += x;
                    if (d - pos[v] > 1) {
                        all.add(0, d - pos[v] - 2, x);
                    }
                    int l = d - pos[v] - 1;
                    int r = min(t[v].n - 1, pos[v] + d);
                    t[v].add(l, r, x);
                }
                /*
                for (int j = 0; j < n; j++) {
                    int ve = j;
                    if (ve == 0) {
                        out.print(val0 + " ");
                    } else {
                        out.print((t[ve].get(pos[ve], pos[ve]) + all.get(pos[ve], pos[ve])) + " ");
                    }
                }
                out.println();
                */
            } else {
                int v = sc.nextInt() - 1;
                if (v == 0) {
                    out.println(val0);
                } else {
                    out.println(t[v].get(pos[v], pos[v]) + all.get(pos[v], pos[v]));
                }
            }
        }
    }
    
    static Throwable uncaught;
    
    BufferedReader in;
    FastScanner sc;
    PrintWriter out;
    
    @Override
    public void run() {
        try {
            in = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
            sc = new FastScanner(in);
            solve();
        } catch (Throwable uncaught) {
            Solution.uncaught = uncaught;
        } finally {
            out.close();
        }
    }
    
    public static void main(String[] args) throws Throwable {
        Thread thread = new Thread (null, new Solution(), "", (1 << 26));
        thread.start();
        thread.join();
        if (Solution.uncaught != null) {
            throw Solution.uncaught;
        }
    }

}

class FastScanner {
    
    BufferedReader in;
    StringTokenizer st;
    
    public FastScanner(BufferedReader in) {
        this.in = in;
    }
    
    public String nextToken() throws Exception {
        while (st == null || !st.hasMoreTokens()) {
            st = new StringTokenizer(in.readLine());
        }
        return st.nextToken();
    }
    
    public int nextInt() throws Exception {
        return Integer.parseInt(nextToken());
    }
    
    public long nextLong() throws Exception {
        return Long.parseLong(nextToken());
    }
    
    public double nextDouble() throws Exception {
        return Double.parseDouble(nextToken());
    }
    
}