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.math.BigDecimal;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.Date;
import java.util.List;
import java.util.PriorityQueue;
import java.util.Scanner;

public class Main {
	class Tree {
		public int val, min, max;
		public boolean cover;
		public Tree() {
			cover = true;
			val = 0;
		}
	}
	public static Scanner cin=new Scanner(System.in);
	public int n, q, m, root;
	public int lay[] = null;
	public int father[] = null;
	public int[][] table = null;
	public int size[] = null;
	public List<Integer>list= null;
	public int tree[][] = null;
	public int stree[] = null;
	public boolean input() {
		if (cin.hasNext() == false) {
			return false;
		}
		n = cin.nextInt();
		q = cin.nextInt();
		table = new int[n+2][2];
		size = new int[n+2];
		lay = new int[n+1];
		father = new int[n+1];
		stree = new int[n+2];
		list = new ArrayList<Integer>();
		int x, y;
		for (int i = 0; i <= n; i++) {
			size[i] = 0;
			father[i] = -1;
			stree[i] = 0;
		}
		stree[n+1] = 0;
		for (int i = 1; i < n; i++) {
			x = cin.nextInt();
			y = cin.nextInt();
			if (x == 1) {
				list.add(y);
			} else {
				table[x][size[x]] = y;
				size[x]++;
			}
			if (y == 1) {
				list.add(x);
			} else {
				table[y][size[y]] = x;
				size[y]++;
			}
		}
		return true;
	}
	public void dfs(int l, int f, int node) {
		father[node] = f;
		lay[node] = l;
		m++;
		for (int i = 0; i < size[node]; i++) {
			int v = table[node][i];
			if (father[v] < 0) {
				dfs(l+1, f, v);
			}
		}
	}
	public int Lowbit(int t) { 
	    return t & ( t ^ ( t - 1 ) ); 
	} 
	public int Sum(int[] in, int end) {
		int sum = 0;
		while (end > 0) {
			sum += in[end];
			end -= Lowbit(end);
		}
		return sum;
	}

	public void insert(int[] in, int pos, int num) {
		while (pos <= in.length-2) {
			in[pos] += num;
			pos += Lowbit(pos);
		}
	}
	public void solve(int tc) {
		father[1] = 0;
		lay[1] = 0;
		root = 0;
		tree = new int[list.size()][];
		for (int i = 0; i < list.size(); i++) {
			m = 0;
			int v = list.get(i);
			dfs(1, i, v);
			tree[i] = new int[m+2];
			for (int j = 0; j <= m+1; j++) {
				tree[i][j] = 0;
			}
		}
		int op, v, x, d;
		for (int i = 0; i < q; i++) {
			op = cin.nextInt();
			if (op == 0) {
				v = cin.nextInt();
				x = cin.nextInt();
				d = cin.nextInt();
				int minL = lay[v] - d;
				int maxL = lay[v] + d;
				if (v == 1) {
					minL = 1;
					maxL = d;
					root += x;
					if (maxL > stree.length - 2) {
						maxL = stree.length - 2;
					}
					insert(stree, minL, x);
					insert(stree, maxL+1, -x);
					continue;
				}
				if (maxL > tree[father[v]].length - 2) {
					maxL = tree[father[v]].length - 2;
				}
				if (minL >= 1) {
					insert(tree[father[v]], minL, x);
					insert(tree[father[v]], maxL+1, -x);
				} else if (minL == 0) {
					root += x;
					insert(tree[father[v]], 1, x);
					insert(tree[father[v]], maxL+1, -x);
				} else {
					int r = minL * (-1);
					if (r > stree.length - 2) {
						r = stree.length - 2;
					}
					root += x;
					insert(stree, 1, x);
					insert(stree, r+1, -x);
					minL = r + 1;
					if (minL <= maxL) {
						insert(tree[father[v]], minL, x);
						insert(tree[father[v]], maxL+1, -x);
					}
				}
			} else {
				v = cin.nextInt();
				if (v == 1) {
					System.out.println(root);
				} else {
					int rs = Sum(tree[father[v]], lay[v]);
					int r2 = Sum(stree, lay[v]);
					System.out.println(rs + r2);
				}
			}
		}
	}
	public void acm(){
		while (input()){ 
			solve(0);
		}
	}
	
	public static void main(String args[]) throws Exception{
		Main ac = new Main();
		ac.acm();
	}
}