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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.ArrayList;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        ProblemEPropagatingTree solver = new ProblemEPropagatingTree();
        solver.solve(1, in, out);
        out.close();
    }

    static class ProblemEPropagatingTree {
        int[] begin;
        int[] end;
        int[] a;
        int[] tree;
        int[] parity;
        ArrayList<Integer>[] edge;
        int n;
        int m;
        int idx;

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            n = in.readInt();
            m = in.readInt();
            a = in.readIntArray(n);
            edge = new ArrayList[n + 1];
            begin = new int[n + 1];
            end = new int[n + 1];
            tree = new int[n + 2];
            parity = new int[n + 1];
            idx = 1;
            for (int i = 0; i <= n; i++) edge[i] = new ArrayList<>();
            for (int i = 1; i < n; i++) {
                int v = in.readInt();
                int u = in.readInt();
                edge[v].add(u);
                edge[u].add(v);
            }
            dfs(1, 0, 0);


            while (m-- > 0) {
                int t = in.readInt();
                int x = in.readInt();
                if (t == 1) {
                    int v = in.readInt();
                    if (parity[x] == 0) {
                        update(begin[x], v);
                        update(end[x] + 1, -v);
                    } else {
                        update(begin[x], -v);
                        update(end[x] + 1, v);
                    }
                } else {
                    int ans;
                    if (parity[x] == 0) {
                        ans = query(begin[x]);
                    } else ans = -query(begin[x]);

                    out.println(ans + a[x - 1]);
                }
            }
        }

        void dfs(int pos, int parent, int par) {
            parity[pos] = par;
            begin[pos] = idx++;
            for (int j : edge[pos]) {
                if (j == parent) continue;
                dfs(j, pos, 1 - par);
            }
            end[pos] = idx - 1;
        }

        void update(int pos, int v) {
            while (pos <= n) {
                tree[pos] += v;
                pos += (pos & -pos);
            }
        }

        int query(int pos) {
            int ans = 0;
            while (pos > 0) {
                ans += tree[pos];
                pos -= (pos & -pos);
            }
            return ans;
        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private InputReader.SpaceCharFilter filter;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1)
                throw new InputMismatchException();
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

        public int readInt() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public boolean isSpaceChar(int c) {
            if (filter != null)
                return filter.isSpaceChar(c);
            return isWhitespace(c);
        }

        public static boolean isWhitespace(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public int[] readIntArray(int size) {
            int[] ans = new int[size];
            for (int i = 0; i < size; i++) ans[i] = readInt();
            return ans;
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }
}

