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


public class E {	
	BufferedReader reader;
    StringTokenizer tokenizer;
    PrintWriter out;
       
	public class FenwickTree{
		int[] element;
		public FenwickTree(int size){
			element = new int[size];
		}
		public void add(int index, int delta){
			while(index < element.length){
				element[index] += delta;
				index = (index+1) + ((index+1) & (-index-1)) - 1;
			}
		}
		public void addrange(int left, int right, int value){
			right = Math.min(right, element.length-1);
			add(left, value);
			add(right+1, -value);
		}
		public int get(int index){
			int sum = 0;
			while( index >= 0){
				sum += element[index];
				index = (index+1) - ( (index+1) & (-index-1) ) - 1;
			}
			return sum;
		}
	}
	
	public void solve() throws IOException {				
		int N = nextInt();
		int Q = nextInt();
		int[] chain_head = new int[N-1];
		int chain_count = 0;
		int[][] edges = new int[N][2];
		int[] edge_count = new int[N];
		for(int i = 0; i < N-1; i++){
			int v1 = nextInt()-1;
			int v2 = nextInt()-1;
			if( v1 > v2 ){
				int tmp = v1; v1 = v2; v2 = tmp;
			}
			if(v1 == 0){
				chain_head[chain_count++] = v2;
			}
			else{
				edges[v1][edge_count[v1]++] = v2;
			}			
			edges[v2][edge_count[v2]++] = v1;		
		}
		
		int[] chains_belong = new int[N];
		int[] chains_depth = new int[chain_count];
		int[] chains = new int[N];
		int[] chains_pos = new int[N];
				
		for(int i = 0; i < chain_count; i++){
			int prev = 0;
			int cur = chain_head[i];			 
			int depth = 0;
			chains_pos[cur] = depth;
			chains_belong[cur] = i;
			while( edge_count[cur] > 1){
				int index = edges[cur][0] != prev? 0: 1;								
				chains[cur] = edges[cur][index];
				prev = cur;
				cur = edges[cur][index];	
				depth++;
				chains_pos[cur] = depth;
				chains_belong[cur] = i;
			}
			chains_depth[i] = depth;
		}
		
		FenwickTree[] trees = new FenwickTree[chain_count];
		int max_depth = 0;
		for(int i = 0; i < chain_count; i++){
			trees[i] = new FenwickTree( chains_depth[i]+1 );
			max_depth = Math.max(max_depth, chains_depth[i]);
		}
		FenwickTree mainTree = new FenwickTree(max_depth+2);				
		
		for(int i = 0; i < Q; i++){
			int op = nextInt();
			if(op == 0){
				int V = nextInt()-1; int X = nextInt(); int D = nextInt();
				
				if( V == 0){
					mainTree.addrange(0, Math.min(D, mainTree.element.length), X);
				}
				else{
					int chain_index = chains_belong[V];
					int chain_pos = chains_pos[V];
					if( chain_pos >= D ){
						trees[chain_index].addrange(chain_pos-D, Math.min(chain_pos+D, chains_depth[chain_index]), X);
					}
					else{
						trees[chain_index].addrange(0, Math.min(chain_pos+D, chains_depth[chain_index]), X);
						int remain = D-chain_pos-1;
						mainTree.addrange(0, remain, X);
						remain--;
						if( remain >= 0)
							trees[chain_index].addrange(0, Math.min(chains_depth[chain_index], remain), -X );
					}
				}
			}
			else{
				int V = nextInt()-1;
				int chain_index = chains_belong[V];
				int chain_pos = chains_pos[V];
				if(V != 0){
					int ans = trees[chain_index].get(chain_pos);
					ans += mainTree.get(chain_pos+1);
					out.println( ans );
				}
				else{
					out.println( mainTree.get(0) );
				}
			}
		}		
	}
	
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		new E().run();
	}
	
	public void run() {
        try {
            reader = new BufferedReader(new InputStreamReader(System.in));
            tokenizer = null;
            out = new PrintWriter(System.out);
            solve();
            reader.close();
            out.close();
        } catch (Exception e) {
            e.printStackTrace();
            System.exit(1);
        }
    }

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

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

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

    String nextToken() throws IOException {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(reader.readLine());
        }
        return tokenizer.nextToken();
    }

}
