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.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
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
 *
 * @author Mufaddal Naya
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        OutputWriter out = new OutputWriter(outputStream);
        ENewYearTree solver = new ENewYearTree();
        solver.solve(1, in, out);
        out.close();
    }

    static class ENewYearTree {
        int[] last;
        int[] first;
        int rr;
        int[] color;
        int[] cc;
        long[] t;
        boolean[] lazy;

        public void solve(int testNumber, InputReader c, OutputWriter w) {
            int n = c.readInt(), q = c.readInt();
            cc = new int[n];
            for (int i = 0; i < n; i++) {
                cc[i] = c.readInt() - 1;
            }
            ArrayList<Integer>[] adj = new ArrayList[n];
            for (int i = 0; i < n; i++) {
                adj[i] = new ArrayList<>();
            }
            for (int i = 0; i < n - 1; i++) {
                int u = c.readInt() - 1, v = c.readInt() - 1;
                adj[u].add(v);
                adj[v].add(u);
            }
            last = new int[n];
            first = new int[n];
            color = new int[2 * n];
            rr = 0;
            dfs_(0, -1, adj);

            t = new long[4 * rr];
            build_(1, 0, rr - 1);
            color = null;

            lazy = new boolean[4 * rr];
            //Queries
            while (q-- > 0) {
                if (c.readInt() == 1) {
                    int xx = c.readInt() - 1, co = c.readInt() - 1;
                    int l = first[xx], r = last[xx];
                    update_(1, 0, rr - 1, l, r, co);
                } else {
                    int xx = c.readInt() - 1;
                    int l = first[xx], r = last[xx];
                    w.printLine(Long.bitCount(query_(1, 0, rr - 1, l, r)));
                }
            }
        }

        private long query_(int v, int vl, int vr, int l, int r) {
            if (vl > r || vr < l) {
                return 0;
            }
            if (lazy[v]) {
                return t[v];
            }
            if (vl >= l && vr <= r) {
                return t[v];
            }
            push_(v);
            int mid = vl + vr >> 1;
            return query_(v << 1, vl, mid, l, r) | query_((v << 1) + 1, mid + 1, vr, l, r);
        }

        private void update_(int v, int vl, int vr, int l, int r, int co) {
            if (vl > r || vr < l) {
                return;
            }
            if (vl >= l && vr <= r) {
                lazy[v] = true;
                t[v] = 1L << co;
                return;
            }
            push_(v);
            int mid = vl + vr >> 1;
            update_(v << 1, vl, mid, l, r, co);
            update_((v << 1) + 1, mid + 1, vr, l, r, co);
            t[v] = t[v << 1] | t[(v << 1) + 1];
        }

        private void push_(int v) {
            if (lazy[v]) {
                t[v << 1] = t[v];
                t[(v << 1) + 1] = t[v];
                lazy[v << 1] = true;
                lazy[(v << 1) + 1] = true;
                lazy[v] = false;
            }
        }

        private void build_(int v, int l, int r) {
            if (l == r) {
                t[v] = 1L << color[l];
            } else {
                int mid = l + r >> 1;
                build_(v << 1, l, mid);
                build_((v << 1) + 1, mid + 1, r);
                t[v] = t[v << 1] | t[(v << 1) + 1];
            }
        }

        private void dfs_(int x, int p, ArrayList<Integer>[] adj) {
            first[x] = rr;
            color[rr++] = cc[x];
            for (int xx : adj[x]) {
                if (xx != p) {
                    dfs_(xx, x, adj);
                }
            }
            last[x] = rr;
            color[rr++] = cc[x];
        }

    }

    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 interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }

    static class OutputWriter {
        private final PrintWriter writer;

        public OutputWriter(OutputStream outputStream) {
            writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
        }

        public OutputWriter(Writer writer) {
            this.writer = new PrintWriter(writer);
        }

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

        public void printLine(int i) {
            writer.println(i);
        }

    }
}