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.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 Artem Gilmudinov
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskAcmpFast solver = new TaskAcmpFast();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskAcmpFast {
        ArrayList<ArrayList<Integer>> g;
        PairInt[] intervals;
        boolean[] used;
        int[] leave;
        int time = 0;

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n, m;
            n = in.readInt();
            m = in.readInt();
            int[] color = new int[n];
            leave = new int[n];
            for (int i = 0; i < n; i++) {
                color[i] = in.readInt();
            }
            //
            g = new ArrayList<ArrayList<Integer>>();
            for (int i = 0; i < n; i++) {
                g.add(new ArrayList<Integer>());
            }
            for (int i = 0; i < n - 1; i++) {
                int u, v;
                u = in.readInt() - 1;
                v = in.readInt() - 1;
                g.get(u).add(v);
                g.get(v).add(u);
            }
            intervals = new PairInt[n];
            for (int i = 0; i < n; i++) {
                intervals[i] = new PairInt(0, 0);
            }

            used = new boolean[n];
            dfs(0);
            int[] mappedColor = new int[n];
            for (int i = 0; i < n; i++) {
                mappedColor[leave[i]] = color[i];
            }
            long val1, val2;
            int t, v, c;
            SegmentTree st = new SegmentTree(mappedColor);
            for (int i = 0; i < m; i++) {
                t = in.readInt();
                v = in.readInt() - 1;
                if (t == 1) {
                    c = in.readInt();
                    st.update(0, st.leafs - 1, intervals[v].x, intervals[v].y, 0, (1l << c));
                    st.update(0, st.leafs - 1, leave[v], leave[v], 0, (1l << c));
                } else {
                    val1 = st.get(0, st.leafs - 1, intervals[v].x, intervals[v].y, 0);
                    val2 = st.get(0, st.leafs - 1, leave[v], leave[v], 0);
                    out.println(bits(val1 | val2));
                }
            }
        }

        public int bits(long val) {
            int res = 0;
            while (val != 0) {
                if ((val & 1) != 0) {
                    res++;
                }
                val >>= 1;
            }
            return res;
        }

        public void dfs(int u) {
            used[u] = true;
            int min, max;
            min = Integer.MAX_VALUE;
            max = Integer.MIN_VALUE;
            for (int v : g.get(u)) {
                if (!used[v]) {
                    dfs(v);
                    min = Math.min(min, intervals[v].x);
                    min = Math.min(min, leave[v]);
                    max = Math.max(max, intervals[v].y);
                    max = Math.max(max, leave[v]);
                }
            }
            leave[u] = time++;
            if (min == Integer.MAX_VALUE) {
                min = leave[u];
                max = leave[u];
            }
            intervals[u].x = min;
            intervals[u].y = max;
        }

        class SegmentTree {
            int leafs;
            long[] nodes;
            long[] set;

            public SegmentTree(int[] colors) {
                int n = colors.length;
                leafs = 1;
                while (leafs < n) {
                    leafs <<= 1;
                }
                nodes = new long[leafs * 2 - 1];
                set = new long[leafs * 2 - 1];
                for (int i = leafs - 1, j = 0; i < leafs - 1 + colors.length; i++, j++) {
                    nodes[i] |= (1l << colors[j]);
                }
                for (int i = leafs - 2; i >= 0; i--) {
                    nodes[i] |= nodes[i * 2 + 1];
                    nodes[i] |= nodes[i * 2 + 2];
                }
            }

            public void push(int node) {
                if (set[node] != 0) {
                    set[node * 2 + 2] = set[node];
                    set[node * 2 + 1] = set[node];
                    set[node] = 0;
                }
            }

            public long getValue(int node) {
                if (set[node] != 0) {
                    return set[node];
                } else {
                    return nodes[node];
                }
            }

            public long get(int tl, int tr, int ql, int qr, int node) {
                if (ql > qr) {
                    return 0;
                }
                if (tl == ql && tr == qr) {
                    return getValue(node);
                }
                push(node);
                int mid = tl + (tr - tl) / 2;
                long val = get(tl, mid, ql, Math.min(mid, qr), node * 2 + 1) | get(mid + 1, tr, Math.max(mid + 1, ql), qr, node * 2 + 2);
                nodes[node] = getValue(node * 2 + 1) | getValue(node * 2 + 2);
                return val;
            }

            public void update(int tl, int tr, int ql, int qr, int node, long value) {
                if (ql > qr) {
                    return;
                }
                if (tl == ql && tr == qr) {
                    set[node] = value;
                    return;
                }
                push(node);
                int mid = tl + (tr - tl) / 2;
                update(tl, mid, ql, Math.min(mid, qr), node * 2 + 1, value);
                update(mid + 1, tr, Math.max(mid + 1, ql), qr, node * 2 + 2, value);
                nodes[node] = getValue(node * 2 + 1) | getValue(node * 2 + 2);
            }

        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private 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 PairInt {
        public int x;
        public int y;

        public PairInt(int x, int y) {
            this.x = x;
            this.y = y;
        }


        public boolean equals(Object obj) {
            PairInt pairInt = (PairInt) obj;
            return pairInt.x == x && pairInt.y == y;
        }

        public String toString() {
            return x + " " + y;
        }

        public PairInt clone() {
            return new PairInt(x, y);
        }

    }
}