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.util.Arrays;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
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;
        FastScanner in = new FastScanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskE solver = new TaskE();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskE {
        int[] firstInSubtree;
        int[] lastInSubtree;
        int dfsIndex;
        int[] firstEdge;
        int[] edgeDst;
        int[] edgeNxt;
        int numEdges;
        int treeSize;
        long[] tree;
        boolean[] full;

        public void solve(int testNumber, FastScanner in, PrintWriter out) {
            int n = in.nextInt();
            int numQueries = in.nextInt();
            int[] startingCol = new int[n];
            for (int i = 0; i < n; i++) {
                startingCol[i] = in.nextInt() - 1;
            }
            firstEdge = new int[n];
            Arrays.fill(firstEdge, -1);
            edgeDst = new int[2 * (n - 1)];
            edgeNxt = new int[2 * (n - 1)];
            for (int i = 0; i < n - 1; i++) {
                int a = in.nextInt() - 1;
                int b = in.nextInt() - 1;
                addEdge(a, b);
                addEdge(b, a);
            }

            firstInSubtree = new int[n];
            lastInSubtree = new int[n];
            dfs(0, -1);
            treeSize = 1;
            while (treeSize < n) {
                treeSize *= 2;
            }
            tree = new long[2 * treeSize];
            full = new boolean[tree.length];

            for (int i = 0; i < n; i++) {
                int l = firstInSubtree[i];
                int r = l;
                set(0, 0, n - 1, l, r, 1L << startingCol[i]);
            }
            for (int query = 0; query < numQueries; query++) {
                int type = in.nextInt();
                int v = in.nextInt() - 1;
                int l = firstInSubtree[v];
                int r = lastInSubtree[v];
                if (type == 1) {
                    int col = in.nextInt() - 1;
                    set(0, 0, n - 1, l, r, 1L << col);
                } else {
                    long u = get(0, 0, n - 1, l, r);
                    out.println(Long.bitCount(u));
                }
            }
        }

        private void push(int root) {
            if (full[root]) {
                full[2 * root + 1] = true;
                full[2 * root + 2] = true;
                tree[2 * root + 1] = tree[root];
                tree[2 * root + 2] = tree[root];
                full[root] = false;
            }
        }

        private void set(int root, int rl, int rr, int l, int r, long val) {
            if (rl > rr || rl > r || l > rr || l > r) {
                return;
            }
            if (rl == l && rr == r) {
                full[root] = true;
                tree[root] = val;
                return;
            }
            push(root);
            int rm = (rl + rr) / 2;
            set(2 * root + 1, rl, rm, l, Math.min(r, rm), val);
            set(2 * root + 2, rm + 1, rr, Math.max(l, rm + 1), r, val);
            tree[root] = tree[2 * root + 1] | tree[2 * root + 2];
        }

        private long get(int root, int rl, int rr, int l, int r) {
            if (rl > rr || rl > r || l > rr || l > r) {
                return 0;
            }
            if (l == rl && r == rr) {
                return tree[root];
            }
            push(root);
            int rm = (rl + rr) / 2;
            long u = get(2 * root + 1, rl, rm, l, Math.min(r, rm));
            long v = get(2 * root + 2, rm + 1, rr, Math.max(l, rm + 1), r);
            return u | v;
        }

        private void dfs(int i, int p) {
            firstInSubtree[i] = dfsIndex;
            dfsIndex++;
            for (int e = firstEdge[i]; e >= 0; e = edgeNxt[e]) {
                int j = edgeDst[e];
                if (j == p) {
                    continue;
                }
                dfs(j, i);
            }
            lastInSubtree[i] = dfsIndex - 1;
        }

        void addEdge(int a, int b) {
            int e = numEdges++;
            edgeDst[e] = b;
            edgeNxt[e] = firstEdge[a];
            firstEdge[a] = e;
        }

    }

    static class FastScanner {
        private BufferedReader in;
        private StringTokenizer st;

        public FastScanner(InputStream stream) {
            in = new BufferedReader(new InputStreamReader(stream));
        }

        public String next() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(in.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return st.nextToken();
        }

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

    }
}