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.*;
import java.util.*;

public class E
{

	static StringBuilder st = new StringBuilder();
	static ArrayList<Integer> [] adjList ;
	static int [] tin , tout , type ; 
	static int timer = 0 ; 
	
	static void dfs(int u , int p , int lvl)
	{
		type[u] = lvl ; 
		
		tin[u] = ++timer; 
		
		for(int v : adjList[u])
		{
			if(v == p) continue ; 
			
			dfs(v, u, lvl ^ 1);
		}
		tout[u] = timer  ; 
	}
	
	public static void main(String[] args) throws Exception 
	{
		Scanner sc = new Scanner(System.in) ; 
		PrintWriter out = new PrintWriter(System.out) ; 
		
		int n = sc.nextInt() , m = sc.nextInt();
		
		int [] a = new int [n] ; 
		for(int i = 0 ; i <  n ; i++) a[i] = sc.nextInt() ; 
		
		int N = 1 ; 
		while(N < n) N <<= 1 ;
		tin = new int [N] ; 
		tout = new int [N] ; 
		type = new int [N] ;  
		
		adjList = new ArrayList[n] ; 
		
		for(int i = 0 ;i < n ;i++)adjList[i] = new ArrayList<>() ; 
		
		for(int i = 0 ;i < n - 1 ;i++) 
		{
			int u = sc.nextInt() - 1, v = sc.nextInt() - 1 ;
			adjList[u].add(v);adjList[v].add(u);
		} 
		dfs(0, -1, 0);
		
		SegmentTree [] segTree = {new SegmentTree(N) , new SegmentTree(N)} ; 
		
		while(m-->0)
		{
			int t = sc.nextInt() ; 
			
			if(t == 1)
			{
				int x = sc.nextInt() - 1, val = sc.nextInt() ; 
				segTree[type[x]].update_range(tin[x], tout[x], val);
				segTree[type[x] ^ 1].update_range(tin[x], tout[x], -val);
			}
			else
			{
				int x = sc.nextInt() - 1; 
				
				out.println(a[x] + segTree[type[x]].query(tin[x], tin[x]));
				
			}
		
		}
		out.flush();
		out.close(); 
		
	}
	static class SegmentTree 
	{
		int [] sTree , lazy;
		int N ; 
		
		public SegmentTree(int N) 
		{
			this.N = N ; 
			sTree = new int [N << 1] ; 
			lazy = new int [N << 1 ] ; 
		}
		
		void update_range(int i, int j, int val)		
		{
			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)		
			{
				sTree[node] += (e-b+1)*val;			
				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);
				sTree[node] = sTree[node<<1] + sTree[node<<1|1];		
			}
			
		}
		void propagate(int node, int b, int mid, int e)		
		{
			lazy[node<<1] += lazy[node];
			lazy[node<<1|1] += lazy[node];
			sTree[node<<1] += (mid-b+1)*lazy[node];		
			sTree[node<<1|1] += (e-mid)*lazy[node];	
			
			lazy[node] = 0;
			
		}
		
		int query(int i, int j)
		{
			return query(1,1,N,i,j);
		}
		
		int query(int node, int b, int e, int i, int j)
		{
			if(i>e || j <b)
				return 0;		
			if(b>= i && e <= j)
				return sTree[node];
			int mid = b + e >> 1;
			propagate(node, b, mid, e);
			
			int q1 = query(node<<1,b,mid,i,j);
			int q2 = query(node<<1|1,mid+1,e,i,j);
			return q1 + q2;	
					
		}
		
		
	}

	static class Scanner 
	{
		BufferedReader br;
		StringTokenizer st;

		Scanner(InputStream in) 
		{
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		String next() throws Exception 
		{
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}

		int nextInt() throws Exception { return Integer.parseInt(next()); }

		long nextLong() throws Exception { return Long.parseLong(next()); }

		double nextDouble() throws Exception { return Double.parseDouble(next());}

	}

	static void shuffle(int[] a) 
	{
		int n = a.length;
		for (int i = 0; i < n; i++) 
		{
			int r = i + (int) (Math.random() * (n - i));
			int tmp = a[i];
			a[i] = a[r];
			a[r] = tmp;
		}
	}

}