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

import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.InputStreamReader;
import java.io.InputStream;
import java.util.ArrayList;

public class E {

    public static void main(String[] args) throws FileNotFoundException {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);

        Solver solver = new Solver();
        solver.solve(1, in, out);

        out.close();
    }

    static class Solver {

        public int[] color, position, to, order;
        public int count;
        public ArrayList<Integer>[] list;

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            int m = in.nextInt();
            color = new int[n];
            position = new int[n];
            order = new int[n];
            to = new int[n];
            for (int i = 0; i < n; i++) {
                color[i] = in.nextInt();
            }
            list = new ArrayList[n + 1];
            for (int i = 0; i < n; i++) {
                list[i] = new ArrayList<Integer>();
            }
            for (int i = 0; i < n - 1; i++) {
                int x = in.nextInt() - 1;
                int y = in.nextInt() - 1;
                list[x].add(y);
                list[y].add(x);
            }
            dfs(0, -1);
            SegmentTree tree = new SegmentTree(n);
            tree.build(1 , 0 , n - 1);
            for (int i = 0 ; i < m ; i++) {
                int type = in.nextInt();
                if (type == 1) {
                    int x = in.nextInt() - 1;
                    int y = in.nextInt();
                    tree.modify(1 , 0 , n - 1 , position[x] , to[x] , (1L << y));
                } else {
                    int x = in.nextInt() - 1;
                    long result = tree.get(1, 0, n - 1, position[x], to[x]);
                    out.println(Long.bitCount(result));
                }
            }
        }

        public void dfs(int v, int p) {
            position[v] = count;
            order[count++] = v;
            for (int i = 0 ; i < list[v].size() ; i++) {
                int u = list[v].get(i);
                if (u != p) {
                    dfs(u , v);
                }
            }
            to[v] = count - 1;
        }

        class SegmentTree {

            public int size;
            public long[] tr;
            public boolean[] put;

            SegmentTree(int size) {
                this.size = size;
                this.tr = new long[4 * size];
                this.put = new boolean[4 * size];
            }

            long doOperation(long a, long b) {
                return a | b;
            }

            void gather(int v) {
                tr[v] = doOperation(tr[v + v], tr[v + v + 1]);
            }

            void build(int v, int l, int r) {
                if (l < r) {
                    int m = (l + r) >> 1;
                    build(v + v, l, m);
                    build(v + v + 1, m + 1, r);
                    gather(v);
                    put[v] = false;
                } else {
                    tr[v] = (1L << color[order[l]]);
                    put[v] = true;
                }
            }

            void push(int v) {
                if (put[v]) {
                    tr[v + v] = tr[v + v + 1] = tr[v];
                    put[v + v] = put[v + v + 1] = true;
                    put[v] = false;
                }
            }

            void modify(int v, int l, int r, int ll, int rr, long value) {
                if (r < ll || rr < l) {
                    return;
                }
                if (ll <= l && r <= rr) {
                    tr[v] = value;
                    put[v] = true;
                    return;
                }
                push(v);
                int m = (l + r) >> 1;
                modify(v + v, l, m, ll, rr, value);
                modify(v + v + 1, m + 1, r, ll, rr, value);
                gather(v);
            }

            long get(int v, int l, int r, int ll, int rr) {
                if (r < ll || rr < l) {
                    return 0;
                }
                if (ll <= l && r <= rr) {
                    return tr[v];
                }
                push(v);
                int m = (l + r) >> 1;
                long res = doOperation(get(v + v, l, m, ll, rr), get(v + v + 1, m + 1, r, ll, rr));
                gather(v);
                return res;
            }
        }
    }

    static class InputReader {

        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream));
            tokenizer = null;
        }

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

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

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

    }
}
