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 Main{
	static public class SegmentTree {		// 1-based DS, OOP
		int N;
		int[] array, lazy;
		
		SegmentTree(int n)		
		{
			N=n;
			array = new int[N+1];
			lazy = new int[N<<2];
		}
		
		
		void update_range(int i, int j, int val)		// O(log n) 
		{
			update_range(1,1,N,i,j,val);
		}
		
		void update_range(int node, int b, int e, int i, int j, int val)
		{
			if(i > e || j < b)		
				return;
			if(b >= i && e <= j)		
			{		
				
				lazy[node] += val;				
			}							
			else		
			{
				int mid = b + e >> 1;
				propagate(node, b, mid, e);
				update_range(node<<1,b,mid,i,j,val);
				update_range(node<<1|1,mid+1,e,i,j,val);		
			}
			
		}
		void propagate(int node, int b, int mid, int e)		
		{
			lazy[node<<1] += lazy[node];
			lazy[node<<1|1] += lazy[node];
			lazy[node] = 0;
		}
		
		int query_point(int i)
		{
			return query_point(1,1,N,i);
		}
		
		int query_point(int node, int b, int e, int i)	// O(log n)
		{	
			if(b == i && e == i)
				return lazy[node]+array[b];
			int mid = b + e >> 1;
			propagate(node, b, mid, e);
			if(i<=mid) {
				return query_point(node<<1,b,mid,i);
			}
			return query_point(node<<1|1,mid+1,e,i);
					
		}
	}
	static LinkedList<Integer>[]adj;
	static int[]treeOf,depth;
	static int dfs(int i,int p,int dep,int idx) {
		depth[i]=dep;
		treeOf[i]=idx;
		for(int j:adj[i]) {
			if(j==p)continue;
			return 1+dfs(j, i, dep+1,idx);
		}
		return 1;
	}
   	static void main() throws Exception{
   		int n=sc.nextInt(),q=sc.nextInt();
   		adj=new LinkedList[n];
   		for(int i=0;i<n;i++)adj[i]=new LinkedList<>();
   		treeOf=new int[n];
   		depth=new int[n];
   		for(int i=0;i<n-1;i++) {
   			int x=sc.nextInt()-1,y=sc.nextInt()-1;
   			adj[x].add(y);
   			adj[y].add(x);
   		}
   		SegmentTree[]trees=new SegmentTree[adj[0].size()+1]; 
   		
   		int idx=1;
   		int maxDepth=0;
   		int[]sub=new int[n];
   		for(int i:adj[0]) {
   			int size=dfs(i, 0, 1, idx);
   			sub[idx]=size;
   			trees[idx++]=new SegmentTree(size);
   			maxDepth=Math.max(maxDepth, size);
   		}
   		trees[0]=new SegmentTree(maxDepth+1);
   		while(q-->0) {
   			if(sc.nextInt()==0) {
   				int v=sc.nextInt()-1,x=sc.nextInt(),d=sc.nextInt();
   				if(v==0) {
   					trees[0].update_range(1, d+1, x);
   					continue;
   				}
   				int cur=depth[v],tree=treeOf[v];
   				int left=cur-d,right=Math.min(cur+d, sub[tree]);
   				int extra=-1;
   				if(left<1) {
   					extra=-left;
   					left=1;
   				}
   				trees[tree].update_range(left, right, x);
   				if(extra!=-1) {
   					trees[0].update_range(1, 1+extra, x);
   					if(extra>0) {
   						trees[tree].update_range(1, extra, -x);
   					}
   				}
   			}
   			else {
   				int v=sc.nextInt()-1;
   				int tree=treeOf[v];
   				if(v==0) {
   					pw.println(trees[0].query_point(1));
   					continue;
   				}
   				pw.println(trees[tree].query_point(depth[v])+trees[0].query_point(depth[v]+1));
   			}
   		}
	}
	public static void main(String[] args) throws Exception{
		pw=new PrintWriter(System.out);
		sc = new MScanner(System.in);
		int tc=1;
		while(tc-->0)main();
		pw.flush();
	}
	static PrintWriter pw;
	static MScanner  sc;
	static class MScanner {
		StringTokenizer st;
		BufferedReader br;
		public MScanner(InputStream system) {
			br = new BufferedReader(new InputStreamReader(system));
		}
 
		public MScanner(String file) throws Exception {
			br = new BufferedReader(new FileReader(file));
		}
 
		public String next() throws IOException {
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}
		public int[] intArr(int n) throws IOException {
	        int[]in=new int[n];for(int i=0;i<n;i++)in[i]=nextInt();
	        return in;
		}
		public long[] longArr(int n) throws IOException {
	        long[]in=new long[n];for(int i=0;i<n;i++)in[i]=nextLong();
	        return in;
		}
		public int[] intSortedArr(int n) throws IOException {
	        int[]in=new int[n];for(int i=0;i<n;i++)in[i]=nextInt();
	        shuffle(in);
	        Arrays.sort(in);
	        return in;
		}
		public long[] longSortedArr(int n) throws IOException {
	        long[]in=new long[n];for(int i=0;i<n;i++)in[i]=nextLong();
	        shuffle(in);
	        Arrays.sort(in);
	        return in;
		}
		public Integer[] IntegerArr(int n) throws IOException {
	        Integer[]in=new Integer[n];for(int i=0;i<n;i++)in[i]=nextInt();
	        return in;
		}
		public Long[] LongArr(int n) throws IOException {
	        Long[]in=new Long[n];for(int i=0;i<n;i++)in[i]=nextLong();
	        return in;
		}
		public String nextLine() throws IOException {
			return br.readLine();
		}
 
		public int nextInt() throws IOException {
			return Integer.parseInt(next());
		}
 
		public double nextDouble() throws IOException {
			return Double.parseDouble(next());
		}
 
		public char nextChar() throws IOException {
			return next().charAt(0);
		}
 
		public long nextLong() throws IOException {
			return Long.parseLong(next());
		}
 
		public boolean ready() throws IOException {
			return br.ready();
		}
 
		public void waitForInput() throws InterruptedException {
			Thread.sleep(3000);
		}
	}
	static void shuffle(int[]in) {
		for(int i=0;i<in.length;i++) {
			int idx=(int)(Math.random()*in.length);
			int tmp=in[i];
			in[i]=in[idx];
			in[idx]=tmp;
		}
	}
	static void shuffle(long[]in) {
		for(int i=0;i<in.length;i++) {
			int idx=(int)(Math.random()*in.length);
			long tmp=in[i];
			in[i]=in[idx];
			in[idx]=tmp;
		}
	}
}
