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 E {

	BufferedReader br;
	PrintWriter out;
	StringTokenizer st;
	boolean eof;

	ArrayList<Integer>[] g;

	void dfs(int v, int p, ArrayList<Integer> chain) {
		chain.add(v);
		for (int i = 0; i < g[v].size(); i++) {
			int to = g[v].get(i);
			if (to != p)
				dfs(to, v, chain);
		}
	}

	static class Fenwick {

		private int[] f;
		private int size;

		public Fenwick(int size) {
			this.size = size;
			f = new int[size];
		}

		void add(int l, int r, int delta) {
			if (l >= size)
				return;
			r = Math.min(r, size - 1);
			fenwickAdd(l, delta);
			fenwickAdd(r + 1, -delta);
		}

		private void fenwickAdd(int pos, int delta) {
			for (; pos < f.length; pos |= pos + 1)
				f[pos] += delta;
		}
		
		int get(int pos) {
			if (pos >= size)
				return 0;
			return fenwickGet(pos);
		}
		
		private int fenwickGet(int pos) {
			int res = 0;
			for (; pos >= 0; pos = (pos & (pos + 1)) - 1)
				res += f[pos];
			return res;
		}

	}

	void solve() throws IOException {
		int n = nextInt();
		int q = nextInt();

		g = new ArrayList[n];
		for (int i = 0; i < n; i++)
			g[i] = new ArrayList<>();

		for (int i = 0; i < n - 1; i++) {
			int v1 = nextInt() - 1;
			int v2 = nextInt() - 1;
			g[v1].add(v2);
			g[v2].add(v1);
		}

		ArrayList<Integer>[] chains = new ArrayList[g[0].size()];
		for (int i = 0; i < g[0].size(); i++) {
			chains[i] = new ArrayList<>();
			dfs(g[0].get(i), 0, chains[i]);
		}

		int[] chainNum = new int[n];
		int[] inChainPos = new int[n];

		chainNum[0] = -1;
		inChainPos[0] = 0;

		for (int i = 0; i < chains.length; i++) {
			ArrayList<Integer> chain = chains[i];
			for (int j = 0; j < chain.size(); j++) {
				int v = chain.get(j);
				chainNum[v] = i;
				inChainPos[v] = j + 1;
			}
		}
		
//		System.err.println(Arrays.toString(chainNum));
//		System.err.println(Arrays.toString(inChainPos));
		
		Fenwick all = new Fenwick(n);
		Fenwick[] byChain = new Fenwick[chains.length];
		
		for (int i = 0; i < chains.length; i++)
			byChain[i] = new Fenwick(chains[i].size() + 1);
		
		for (int i = 0; i < q; i++) {
			int type = nextInt();
			if (type == 0) {
				int v = nextInt() - 1;
				int delta = nextInt();
				int dist = nextInt();
				
				if (v == 0) {
					all.add(0, dist, delta);
					continue;
				}
				
				if (dist < inChainPos[v]) {
					byChain[chainNum[v]].add(inChainPos[v] - dist, inChainPos[v] + dist, delta);
					continue;
				}
				
				int allAdd = dist - inChainPos[v];
				
				all.add(0, allAdd, delta);
				
//				System.err.println(allAdd + 1 + " " + (inChainPos[v] + dist));
				
				byChain[chainNum[v]].add(allAdd + 1, inChainPos[v] + dist, delta);
				
				
			} else if (type == 1) {
				int v = nextInt() - 1;
				if (v == 0) {
					out.println(all.get(0));
				} else {
					out.println(all.get(inChainPos[v]) + byChain[chainNum[v]].get(inChainPos[v]));
				}
			}
		}

	}

	E() throws IOException {
		br = new BufferedReader(new InputStreamReader(System.in));
		out = new PrintWriter(System.out);
		solve();
		out.close();
	}

	public static void main(String[] args) throws IOException {
		new E();
	}

	String nextToken() {
		while (st == null || !st.hasMoreTokens()) {
			try {
				st = new StringTokenizer(br.readLine());
			} catch (Exception e) {
				eof = true;
				return null;
			}
		}
		return st.nextToken();
	}

	String nextString() {
		try {
			return br.readLine();
		} catch (IOException e) {
			eof = true;
			return null;
		}
	}

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

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

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