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.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.StringTokenizer;


public class E 
{
	static class Scanner
	{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer("");
		
		public String nextLine()
		{
			try
			{
				return br.readLine();
			}
			catch(Exception e)
			{
				throw(new RuntimeException());
			}
		}
		
		public String next()
		{
			while(!st.hasMoreTokens())
			{
				String l = nextLine();
				if(l == null)
					return null;
				st = new StringTokenizer(l);
			}
			return st.nextToken();
		}
		
		public int nextInt()
		{
			return Integer.parseInt(next());
		}
		
		public long nextLong()
		{
			return Long.parseLong(next());
		}
		
		public double nextDouble()
		{
			return Double.parseDouble(next());
		}
		
		public int[] nextIntArray(int n)
		{
			int[] res = new int[n];
			for(int i = 0; i < res.length; i++)
				res[i] = nextInt();
			return res;
		}
		
		public long[] nextLongArray(int n)
		{
			long[] res = new long[n];
			for(int i = 0; i < res.length; i++)
				res[i] = nextLong();
			return res;
		}
		
		public double[] nextDoubleArray(int n)
		{
			double[] res = new double[n];
			for(int i = 0; i < res.length; i++)
				res[i] = nextLong();
			return res;
		}
		public void sortIntArray(int[] array)
		{
			Integer[] vals = new Integer[array.length];
			for(int i = 0; i < array.length; i++)
				vals[i] = array[i];
			Arrays.sort(vals);
			for(int i = 0; i < array.length; i++)
				array[i] = vals[i];
		}
		
		public void sortLongArray(long[] array)
		{
			Long[] vals = new Long[array.length];
			for(int i = 0; i < array.length; i++)
				vals[i] = array[i];
			Arrays.sort(vals);
			for(int i = 0; i < array.length; i++)
				array[i] = vals[i];
		}
		
		public void sortDoubleArray(double[] array)
		{
			Double[] vals = new Double[array.length];
			for(int i = 0; i < array.length; i++)
				vals[i] = array[i];
			Arrays.sort(vals);
			for(int i = 0; i < array.length; i++)
				array[i] = vals[i];
		}
	}
	
	public static class Fenwick
	{
		long[] fenwickTree;
		int tam;
		int tamHijos;
		
		public Fenwick(int tamE)
		{
			tam = tamE;
			tamHijos = tamE;
			fenwickTree = new long[tam];
		}
		
		long query(int a, int b) 
		{
		    if (a == 0)
		    {
		        long sum = 0;
		        for (; b >= 0; b = (b & (b + 1)) - 1)
		          sum += fenwickTree[b];
		        return sum;
		    } 
		    else 
		    {
		        return (query(0, b) - query(0, a - 1));
		    }
		}
	
		void increase(int k, long inc)
		{
		    for (; k < tam + 1; k |= k + 1)
		    {
		        fenwickTree[k] += inc;
		    }
		}
		
		void increaseRange(int a, int b, int x)
		{
			if(a > b)
				return;
			if(b > tamHijos)
				b = tamHijos;
			if(a < 0)
				a = 0;
			if(a > b)
				return;
			increase(a, x);
			increase(b + 1, -x);
		}

		public void cambiarTam(int i) 
		{
			tam = i;
			tamHijos = i - 1;
			fenwickTree = new long[i + 5];
		}
	}

	static class Nodo
	{
		int altura;
		Nodo padre = null;
		ArrayList <Nodo> aristas = new ArrayList <Nodo> ();
		Fenwick miFenwick;
		int id;
		
		Nodo(int i)
		{
			id = i;
		}
		
		void agregar(int distancia, int x)
		{
			if(id == 0)
			{
				alturas.increaseRange(0, distancia, x);
				return;
			}
			else
			{
				int hastaDonde = distancia - altura;
				if(hastaDonde < 0)
					miFenwick.increaseRange(altura - distancia, altura + distancia, x);
				else
				{
					miFenwick.increaseRange(hastaDonde + 1, altura + distancia, x);
					alturas.increaseRange(0, hastaDonde, x);
				}
			}
		}
		
		long query()
		{
			return (id == 0 ? 0 : miFenwick.query(0, altura)) + alturas.query(0, altura);
		}
	}
	
	static Fenwick alturas = new Fenwick(200000);
	static Nodo[] nodos;	
	
	static void construirArbol()
	{
		LinkedList <Nodo> cola = new LinkedList <Nodo> ();
		nodos[0].altura = 0;
		for(Nodo n : nodos[0].aristas)
		{
			n.padre = nodos[0];
			n.altura = 1;
			n.miFenwick = new Fenwick(0);
			cola.add(n);
		}
		while(!cola.isEmpty())
		{
			Nodo actual = cola.poll();
			int hijos = 0;
			for(Nodo n : actual.aristas)
			{
				if(n == actual.padre)
					continue;
				n.miFenwick = actual.miFenwick;
				n.altura = actual.altura + 1;
				n.padre = actual;
				cola.addFirst(n);
				hijos++;
			}
			if(hijos == 0)
				actual.miFenwick.cambiarTam(actual.altura + 1);
		}
	}
	
	
	public static void main(String[] args) throws IOException
	{
		Scanner sc = new Scanner();
		int n = sc.nextInt();
		int q = sc.nextInt();
		nodos = new Nodo[n];
		for(int i = 0; i < n; i++)
			nodos[i] = new Nodo(i);
		for(int i = 0; i < n - 1; i++)
		{
			int a = sc.nextInt() - 1;
			int b = sc.nextInt() - 1;
			nodos[a].aristas.add(nodos[b]);
			nodos[b].aristas.add(nodos[a]);
		}
		construirArbol();
		BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
		for(int i = 0; i < q; i++)
		{
			int cual = sc.nextInt();
			if(cual == 0)
			{
				int v = sc.nextInt() - 1;
				int x = sc.nextInt();
				int distancia = sc.nextInt();
				nodos[v].agregar(distancia, x);
			}
			else
			{
				int v = sc.nextInt() - 1;
				bw.write(nodos[v].query() + "\n");
			}
		}
		bw.flush();
	}
}
