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 javax.swing.plaf.synth.SynthEditorPaneUI;
import java.io.*;
import java.util.*;

public class Contest1 {
    static int[]val,dis,mx;
    static ArrayList<Integer>[]adj;
    static void dfs(int u,int p){
        mx[val[u]]=dis[val[u]];
        for (int v:adj[u]){
            if (v!=p){
                val[v]=1+val[u];
                dis[val[v]]=1+dis[val[u]];
                dfs(v,u);
                mx[val[u]]=mx[val[v]];
            }
        }
    }
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        PrintWriter pw = new PrintWriter(System.out);
        int n = sc.nextInt();
        int q = sc.nextInt();
        adj= new ArrayList[n];
        for (int i =0;i<n;i++)adj[i]=new ArrayList<>();
        for (int i =1;i<n;i++){
            int u = sc.nextInt()-1;
            int v = sc.nextInt()-1;
            adj[u].add(v);
            adj[v].add(u);
        }
        val= new int[n+1];
        dis= new int[n+1];
        mx= new int[n+1];
        int x = 1;
        for (int v:adj[0]){
            val[v]=x;
            dis[x]=0;
            dfs(v,0);
            x+=mx[x]+1;
        }
        FenwickTree vals = new FenwickTree(n+1);
        FenwickTree vals2= new FenwickTree(n+1);
        FenwickTree upd = new FenwickTree(n+1);
        while (q-->0){
            if (sc.nextInt()==0){
                int node = sc.nextInt()-1;
                x= sc.nextInt();
                int d  = sc.nextInt();
                if (node==0){
                    upd.point_update(d+1,x);
                }
                else {
                    node=val[node];
                    vals.point_update(node+Math.min(mx[node]-dis[node],d),x);
                    if (dis[node]!=0){
                        vals.point_update(node-1,-x);
                    }
                    vals2.point_update(node,-x);
                    vals2.point_update(node-Math.min(dis[node],d),x);
                    if (d>dis[node]){
                        int req= d-dis[node]-1;
                        upd.point_update(req+1,x);
                        if (req>0){
                            vals.point_update((node-dis[node]+Math.min(req-1,mx[node])),-x);
                        }
                    }
                }
            }
            else {
                int node= sc.nextInt()-1;
                if (node==0){
                    pw.println(upd.rsq(n+1));
                }
                else {
                    node=val[node];
                    long vv= upd.rsq(dis[node]+2,n+1);
                    vv+=vals2.rsq(node-dis[node],node);
                    vv+=vals.rsq(node,node+(mx[node]-dis[node]));
                    pw.println(vv);
                }
            }
        }
        pw.flush();
    }

    static class FenwickTree { // one-based DS

        int n;
        long[] ft;

        FenwickTree(int size) { n = size; ft = new long[n+1]; }

        long rsq(int b) //O(log n)
        {
            long sum = 0;
            while(b > 0) { sum += ft[b]; b -= b & -b;}		//min?
            return sum;
        }

        long rsq(int a, int b) { return rsq(b) - rsq(a-1); }

        void point_update(int k, int val)	//O(log n), update = increment
        {
            while(k <= n) { ft[k] += val; k += k & -k; }		//min?
        }


    }
    static long gcd(long a,long b){
        if (a==0)
            return b;
        return gcd(b%a,a);
    }
    static class Scanner {
        StringTokenizer st;
        BufferedReader br;

        public Scanner(FileReader r) {
            br = new BufferedReader(r);
        }

        public Scanner(InputStream s) {
            br = new BufferedReader(new InputStreamReader(s));
        }

        public String next() throws IOException {
            while (st == null || !st.hasMoreTokens())
                st = new StringTokenizer(br.readLine());
            return st.nextToken();
        }

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

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

        public String nextLine() throws IOException {
            return br.readLine();
        }

        public double nextDouble() throws IOException {
            String x = next();
            StringBuilder sb = new StringBuilder("0");
            double res = 0, f = 1;
            boolean dec = false, neg = false;
            int start = 0;
            if (x.charAt(0) == '-') {
                neg = true;
                start++;
            }
            for (int i = start; i < x.length(); i++)
                if (x.charAt(i) == '.') {
                    res = Long.parseLong(sb.toString());
                    sb = new StringBuilder("0");
                    dec = true;
                } else {
                    sb.append(x.charAt(i));
                    if (dec)
                        f *= 10;
                }
            res += Long.parseLong(sb.toString()) / f;
            return res * (neg ? -1 : 1);
        }

        public boolean ready() throws IOException {
            return br.ready();
        }
    }
}