CF620E.New Year Tree

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.

新年假期结束了，但雷沙不想扔掉新年树。他邀请了他最好的朋友凯里姆和古拉尔来帮他重新装饰这棵新年树。

这棵新年树是一棵具有 $n$ 个顶点的无向树，根节点为顶点 $1$。

你需要处理两类查询：

1. 将顶点 $v$ 的子树中所有顶点的颜色更改为颜色 $c$。
2. 查询顶点 $v$ 的子树中不同颜色的数量。

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 c__i (1 ≤ c__i ≤ 60) — the colour of the i-th vertex.

Each of the next n - 1 lines contains two integers x__j, y__j (1 ≤ x__j, y__j ≤ 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 t__k (1 ≤ t__k ≤ 2) — the type of the k-th query. For the queries of the first type then follows two integers v__k, c__k (1 ≤ v__k ≤ n, 1 ≤ c__k ≤ 60) — the number of the vertex whose subtree will be recoloured with the colour c__k. For the queries of the second type then follows integer v__k (1 ≤ v__k ≤ n) — the number of the vertex for which subtree you should find the number of different colours.

第一行包含两个整数 $n$、$m$（$1 \leq n, m \leq 4 \cdot 10^5$）—— 分别表示树中顶点的数量和查询的数量。

第二行包含 $n$ 个整数 $c_i$（$1 \leq c_i \leq 60$）—— 表示第 $i$ 个顶点的颜色。

接下来的 $n-1$ 行，每行包含两个整数 $x_j$、$y_j$（$1 \leq x_j, y_j \leq n$）—— 表示第 $j$ 条边所连接的两个顶点。保证所给图是一棵合法的无向树。

最后 $m$ 行描述了各次查询。每次查询的描述以一个整数 $t_k$（$1 \leq t_k \leq 2$）开头——表示第 $k$ 次查询的类型。对于类型为 1 的查询，其后跟随两个整数 $v_k$、$c_k$（$1 \leq v_k \leq n$，$1 \leq c_k \leq 60$）—— 表示将顶点 $v_k$ 的子树全部重新染为颜色 $c_k$；对于类型为 2 的查询，其后跟随一个整数 $v_k$（$1 \leq v_k \leq n$）—— 表示你需要计算顶点 $v_k$ 的子树中不同颜色的数量。

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.

对于每个第二类查询，请输出整数 $a$ —— 即查询中给定顶点的子树中不同颜色的数量。

每个数字应按照输入中查询出现的顺序，每行输出一个。