Iahub likes trees very much. Recently he discovered an interesting tree named propagating tree. The tree consists of n nodes numbered from 1 to n, each node i having an initial value ai. The root of the tree is node 1.

This tree has a special property: when a value val is added to a value of node i, the value -val is added to values of all the children of node i. Note that when you add value -val to a child of node i, you also add -(-val) to all children of the child of node i and so on. Look an example explanation to understand better how it works.

This tree supports two types of queries:

  * "1 x val" — val is added to the value of node x; 
  * "2 x" — print the current value of node x. 



In order to help Iahub understand the tree better, you must answer m queries of the preceding type.

Input

The first line contains two integers n and m (1 ≤ n, m ≤ 200000). The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 1000). Each of the next n–1 lines contains two integers vi and ui (1 ≤ vi, ui ≤ n), meaning that there is an edge between nodes vi and ui.

Each of the next m lines contains a query in the format described above. It is guaranteed that the following constraints hold for all queries: 1 ≤ x ≤ n, 1 ≤ val ≤ 1000.

Output

For each query of type two (print the value of node x) you must print the answer to the query on a separate line. The queries must be answered in the order given in the input.

Examples

Input

5 5
1 2 1 1 2
1 2
1 3
2 4
2 5
1 2 3
1 1 2
2 1
2 2
2 4


Output

3
3
0

Note

The values of the nodes are [1, 2, 1, 1, 2] at the beginning.

Then value 3 is added to node 2. It propagates and value -3 is added to it's sons, node 4 and node 5. Then it cannot propagate any more. So the values of the nodes are [1, 5, 1, - 2, - 1].

Then value 2 is added to node 1. It propagates and value -2 is added to it's sons, node 2 and node 3. From node 2 it propagates again, adding value 2 to it's sons, node 4 and node 5. Node 3 has no sons, so it cannot propagate from there. The values of the nodes are [3, 3, - 1, 0, 1].

You can see all the definitions about the tree at the following link: http://en.wikipedia.org/wiki/Tree_(graph_theory)
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.StringTokenizer;


public class E{
	
	static class Scanner{
		BufferedReader br=null;
		StringTokenizer tk=null;
		public Scanner(){
			br=new BufferedReader(new InputStreamReader(System.in));
		}
		public String next() throws IOException{
			while(tk==null || !tk.hasMoreTokens())
				tk=new StringTokenizer(br.readLine());
			return tk.nextToken();
		}
		public int nextInt() throws NumberFormatException, IOException{
			return Integer.valueOf(next());
		}
		public long nextLong() throws NumberFormatException, IOException{
			return Long.valueOf(next());
		}
		public double nextDouble() throws NumberFormatException, IOException{
			return Double.valueOf(next());
		}
	}
	
	static class Fenwick{
			long[] tree;
			public Fenwick(int tam){
				tree = new long[tam];
				Arrays.fill(tree,0);
			}
			long query(int a, int b){
			    	if (a == 0) {
				    	long sum = 0;
				    	for (; b >= 0; b = (b & (b + 1)) - 1)
				    		sum += tree[b];
				    	return sum;
			    	}
			    	else {
			    		return query(0, b) - query(0, a - 1);
			    	}
			}
			void increase(int k, int inc){
				for (; k < (int) tree.length; k |= k + 1)
					tree[k] += inc;
	      		}
    	}
	
	
	static class Node{
		int type;
		LinkedList<Integer> hijos;
		int idx;
		int value;
		int rightmost;
		int papa;
		public Node(int v){
			hijos = new LinkedList<Integer>();
			papa = rightmost = type = idx = -1;
			value = v;
		}
	}
	
	static void name(int id, int f, int papa){
		array[id].papa = papa;
		array[id].type = f;
		array[id].idx = idx[f];
		idx[f]++;
		array[id].hijos.removeFirstOccurrence(papa);
		for(int h: array[id].hijos)
			for(int hh: array[h].hijos){
				if (hh == id)
					continue;
				name(hh, f, h);
			}
		array[id].rightmost = idx[f] - 1;
		return;
	}
	

	
	static int N,M;
	static Fenwick[] fw = new Fenwick[2];
	static int[] idx = new int[2];
	static Node[] array;
	
	
	public static void main(String args[]) throws NumberFormatException, IOException{
		Scanner sc = new Scanner();
		BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
		N = sc.nextInt();
		M = sc.nextInt();
		Arrays.fill(idx, 0);
		array = new Node[N];
		for(int i = 0; i < N; i++){
			int v = sc.nextInt();
			array[i] = new Node(v);
		}
		for(int i = 0; i < N - 1; i++){
			int a = sc.nextInt() - 1;
			int b = sc.nextInt() - 1;
			array[a].hijos.add(b);
			array[b].hijos.add(a);
		}
		name(0, 0, -1);
		for(int h: array[0].hijos)
			name(h, 1, 0);
		
//		for(int i = 0; i < N; i++){
//			System.out.println("node "+ i);
//			System.out.println("type "+ array[i].type);
//			System.out.println("idx "+ array[i].idx);
//			System.out.println("right "+ array[i].rightmost);
//			System.out.println("=======\n");
//		}
		
		for(int i = 0; i < 2; i++)
			fw[i] = new Fenwick(idx[i] + 5);
		
		for(int q = 0; q < M; q++){
			int op = sc.nextInt();
			int x = sc.nextInt() - 1;
			int val = 0;
			if (op == 1){
				val = sc.nextInt();
				fw[array[x].type].increase(array[x].idx, val);
				fw[array[x].type].increase(array[x].rightmost + 1, -val);
				if (array[x].hijos.size() > 0){
					int primero = array[x].hijos.getFirst();
					int ultimo = array[x].hijos.getLast();
					int nt = array[primero].type;
					fw[nt].increase(array[primero].idx, -val);
					fw[nt].increase(array[ultimo].rightmost + 1, val);
				}
			}
			else
				bw.write((fw[array[x].type].query(0, array[x].idx) + array[x].value) + "\n");
		}
		bw.flush();
	}

}
