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.OutputStream;
import java.io.InputStreamReader;
import java.io.FileNotFoundException;
import java.io.File;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;
import java.io.Writer;
import java.io.BufferedReader;
import java.io.UnsupportedEncodingException;
import java.io.InputStream;

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

    static class NewYearAndTree {
        long[] tree;
        long[] color;
        List<Integer>[] g;
        int[] from;
        int[] to;
        int[] was;
        int time = 0;
        boolean[] should;

        private void dfs(int cur, int parent) {
            from[cur] = time;
            was[time++] = cur;
            for (int next : g[cur]) {
                if (next != parent) {
                    dfs(next, cur);
                }
            }
            to[cur] = time - 1;
        }

        void build(int root, int l, int r) {
            if (l < r) {
                int y = (l + r) >> 1;
                build(2 * root, l, y);
                build(2 * root + 1, y + 1, r);
                tree[root] = tree[2 * root] | tree[2 * root + 1];
                should[root] = false;
            } else {
                tree[root] = 1L << color[was[l]];
                should[root] = true;
            }
        }

        void prop(int root) {
            if (should[root]) {
                tree[root * 2] = tree[root];
                tree[root * 2 + 1] = tree[root];
                should[root * 2] = should[root * 2 + 1] = true;
                should[root] = false;
            }
        }

        long query(int x, int l, int r, int ll, int rr) {
            if (r < ll || rr < l) {
                return 0;
            }
            if (ll <= l && r <= rr) {
                return tree[x];
            }
            prop(x);
            int y = (l + r) >> 1;
            long res = query(2 * x, l, y, ll, rr);
            res |= query(2 * x + 1, y + 1, r, ll, rr);
            tree[x] = tree[x * 2] | tree[x * 2 + 1];
            return res;
        }

        void update(int x, int l, int r, int ll, int rr, long v) {
            if (r < ll || rr < l) {
                return;
            }
            if (ll <= l && r <= rr) {
                tree[x] = v;
                should[x] = true;
                return;
            }
            prop(x);
            int y = (l + r) >> 1;
            update(2 * x, l, y, ll, rr, v);
            update(2 * x + 1, y + 1, r, ll, rr, v);
            tree[x] = tree[x * 2] | tree[x * 2 + 1];
        }

        public void solve(int testNumber, FastReader in, OutputWriter out) {
            int n = in.nextInt();
            int m = in.nextInt();
            tree = new long[4 * n + 2];
            was = new int[4 * n + 2];
            should = new boolean[8 * n + 2];
            color = new long[n];
            from = new int[n];
            to = new int[n];
            g = GraphUtils.generateGraph(n);
            for (int i = 0; i < n; i++) color[i] = in.nextInt();
            for (int i = 0; i < n - 1; i++) {
                int f = in.nextInt() - 1;
                int t = in.nextInt() - 1;
                g[f].add(t);
                g[t].add(f);
            }
            dfs(0, -1);
            build(1, 0, n - 1);

            while (m-- > 0) {
                int type = in.nextInt();
                if (type == 2) {
                    int v = in.nextInt() - 1;
                    long ans = query(1, 0, n - 1, from[v], to[v]);
                    out.println(Long.bitCount(ans));
                } else {
                    int v = in.nextInt() - 1;
                    long cr = in.nextInt();
                    update(1, 0, n - 1, from[v], to[v], 1L << cr);
                }
            }
        }

    }

    static class FastReader {
        BufferedReader reader;
        StringTokenizer st;

        public FastReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream));
            st = null;
        }

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

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

    }

    static class GraphUtils {
        private GraphUtils() {
        }

        public static List<Integer>[] generateGraph(int n) {
            List<Integer>[] graph = new ArrayList[n];
            for (int i = 0; i < n; i++) {
                graph[i] = new ArrayList<>();
            }
            return graph;
        }

    }

    static class OutputWriter extends PrintWriter {
        public OutputWriter(OutputStream os, boolean autoFlush) {
            super(os, autoFlush);
        }

        public OutputWriter(Writer out) {
            super(out);
        }

        public OutputWriter(Writer out, boolean autoFlush) {
            super(out, autoFlush);
        }

        public OutputWriter(String fileName) throws FileNotFoundException {
            super(fileName);
        }

        public OutputWriter(String fileName, String csn) throws FileNotFoundException, UnsupportedEncodingException {
            super(fileName, csn);
        }

        public OutputWriter(File file) throws FileNotFoundException {
            super(file);
        }

        public OutputWriter(File file, String csn) throws FileNotFoundException, UnsupportedEncodingException {
            super(file, csn);
        }

        public OutputWriter(OutputStream out) {
            super(out);
        }


        public void flush() {
            super.flush();
        }


        public void close() {
            super.close();
        }

    }
}