Problem: The New Year holidays are over, but Resha doesn't want to throw away the New Year tree. He invited his best friends Kerim and Gural to help him to redecorate the New Year tree.

The New Year tree is an undirected tree with n vertices and root in the vertex 1.

You should process the queries of the two types:

  1. Change the colours of all vertices in the subtree of the vertex v to the colour c. 
  2. Find the number of different colours in the subtree of the vertex v. 

Input

The first line contains two integers n, m (1 ≤ n, m ≤ 4·105) — the number of vertices in the tree and the number of the queries.

The second line contains n integers ci (1 ≤ ci ≤ 60) — the colour of the i-th vertex.

Each of the next n - 1 lines contains two integers xj, yj (1 ≤ xj, yj ≤ n) — the vertices of the j-th edge. It is guaranteed that you are given correct undirected tree.

The last m lines contains the description of the queries. Each description starts with the integer tk (1 ≤ tk ≤ 2) — the type of the k-th query. For the queries of the first type then follows two integers vk, ck (1 ≤ vk ≤ n, 1 ≤ ck ≤ 60) — the number of the vertex whose subtree will be recoloured with the colour ck. For the queries of the second type then follows integer vk (1 ≤ vk ≤ n) — the number of the vertex for which subtree you should find the number of different colours.

Output

For each query of the second type print the integer a — the number of different colours in the subtree of the vertex given in the query.

Each of the numbers should be printed on a separate line in order of query appearing in the input.

Examples

Input

7 10
1 1 1 1 1 1 1
1 2
1 3
1 4
3 5
3 6
3 7
1 3 2
2 1
1 4 3
2 1
1 2 5
2 1
1 6 4
2 1
2 2
2 3


Output

2
3
4
5
1
2


Input

23 30
1 2 2 6 5 3 2 1 1 1 2 4 5 3 4 4 3 3 3 3 3 4 6
1 2
1 3
1 4
2 5
2 6
3 7
3 8
4 9
4 10
4 11
6 12
6 13
7 14
7 15
7 16
8 17
8 18
10 19
10 20
10 21
11 22
11 23
2 1
2 5
2 6
2 7
2 8
2 9
2 10
2 11
2 4
1 12 1
1 13 1
1 14 1
1 15 1
1 16 1
1 17 1
1 18 1
1 19 1
1 20 1
1 21 1
1 22 1
1 23 1
2 1
2 5
2 6
2 7
2 8
2 9
2 10
2 11
2 4


Output

6
1
3
3
2
1
2
3
5
5
1
2
2
1
1
1
2
3

Solution (in JAVA):

Solution:
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.FilterInputStream;
import java.io.BufferedInputStream;
import java.io.InputStream;

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

    static class ENewYearTree {
        int[] intime;
        int[] outtime;
        int time;
        int[][] g;
        SegLazy segLazy;

        void update(int l, int r, int p) {
            segLazy.update(l, r, 1l << p);
        }

        int getDistinct(int l, int r) {
            int ans = 0;
            return Long.bitCount(segLazy.getSum(l, r));
        }

        public void solve(int testNumber, ScanReader in, PrintWriter out) {
            int n = in.scanInt();
            int m = in.scanInt();

            intime = new int[n + 1];
            outtime = new int[n + 1];
            time = 0;
            segLazy = new SegLazy(n + 10);

            int col[] = new int[n + 1];
            for (int i = 1; i <= n; i++) col[i] = in.scanInt();
            int from[] = new int[n - 1];
            int to[] = new int[n - 1];
            for (int i = 0; i < n - 1; i++) {
                from[i] = in.scanInt();
                to[i] = in.scanInt();
            }
            g = CodeX.packGraph(from, to, n);
            time = 0;
            dfs(1, -1);


            for (int i = 1; i <= n; i++) segLazy.update(intime[i], intime[i], 1l << col[i]);

            while (m-- > 0) {
                int t = in.scanInt();
                if (t == 1) {
                    int v = in.scanInt();
                    int c = in.scanInt();
                    update(intime[v], outtime[v] - 1, c);
                } else {
                    int v = in.scanInt();
                    out.println(getDistinct(intime[v], outtime[v] - 1));
                }

            }

        }

        void dfs(int node, int parent) {
            intime[node] = time++;
            for (int k : g[node]) {
                if (k != parent) {
                    dfs(k, node);
                }
            }
            outtime[node] = time;
        }

        public class SegLazy {
            int n;
            long[] tree;
            long[] lazy;

            public SegLazy(int n) {
                this.n = n;
                this.tree = new long[(4 * n) + 5];
                this.lazy = new long[(4 * n) + 5];
            }

            public void update(int l, int r, long val) {
                if (l > r) return;
                update(1, 0, n - 1, l, r, val);
            }

            public long getSum(int l, int r) {
                return queryRange(1, 0, n - 1, l, r);
            }

            private void update(int node, int start, int end, int l, int r, long val) {
                LAZY(node, start, end);
                if (start > end || start > r || end < l) return;
                if (start >= l && end <= r) {
                    tree[node] = val;
                    if (start != end) {
                        lazy[node * 2] = val;
                        lazy[(node * 2) + 1] = val;
                    }
                    return;
                }
                int mid = (start + end) / 2;
                update(node * 2, start, mid, l, r, val);
                update((node * 2) + 1, mid + 1, end, l, r, val);
                tree[node] = tree[node * 2] | tree[(node * 2) + 1];
            }

            private void LAZY(int node, int start, int end) {
                if (lazy[node] != 0) {
                    tree[node] = lazy[node];
                    if (start != end) {
                        lazy[node * 2] = lazy[node];
                        lazy[(node * 2) + 1] = lazy[node];
                    }
                    lazy[node] = 0;
                }
            }

            private long queryRange(int node, int start, int end, int l, int r) {
                if (start > end || start > r || end < l) return 0;
                LAZY(node, start, end);
                if (start >= l && end <= r) return ((tree[node]));
                int mid = (start + end) / 2;
                long p1 = queryRange(node * 2, start, mid, l, r);
                long p2 = queryRange((node * 2) + 1, mid + 1, end, l, r);
                return ((p1 | p2));
            }

        }

    }

    static class ScanReader {
        private byte[] buf = new byte[4 * 1024];
        private int INDEX;
        private BufferedInputStream in;
        private int TOTAL;

        public ScanReader(InputStream inputStream) {
            in = new BufferedInputStream(inputStream);
        }

        private int scan() {
            if (INDEX >= TOTAL) {
                INDEX = 0;
                try {
                    TOTAL = in.read(buf);
                } catch (Exception e) {
                    e.printStackTrace();
                }
                if (TOTAL <= 0) return -1;
            }
            return buf[INDEX++];
        }

        public int scanInt() {
            int I = 0;
            int n = scan();
            while (isWhiteSpace(n)) n = scan();
            int neg = 1;
            if (n == '-') {
                neg = -1;
                n = scan();
            }
            while (!isWhiteSpace(n)) {
                if (n >= '0' && n <= '9') {
                    I *= 10;
                    I += n - '0';
                    n = scan();
                }
            }
            return neg * I;
        }

        private boolean isWhiteSpace(int n) {
            if (n == ' ' || n == '\n' || n == '\r' || n == '\t' || n == -1) return true;
            else return false;
        }

    }

    static class CodeX {
        public static int[][] packGraph(int[] from, int[] to, int n) {
            int[][] g = new int[n + 1][];
            int p[] = new int[n + 1];
            for (int i : from) p[i]++;
            for (int i : to) p[i]++;
            for (int i = 0; i <= n; i++) g[i] = new int[p[i]];
            for (int i = 0; i < from.length; i++) {
                g[from[i]][--p[from[i]]] = to[i];
                g[to[i]][--p[to[i]]] = from[i];
            }
            return g;
        }

    }
}