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 CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 4e5 + 5;
const long long one = 1;
vector<int> adj[N];
int col[N], arrival[N], departure[N], timer = 0;
int nd[N];
struct node {
  long long val;
  int lazy;
  node *left, *right;
  node* build(int start, int end) {
    lazy = 0;
    if (start == end) {
      val = (one << col[nd[start]]);
    } else {
      int mid = (start + end) / 2;
      left = new node, right = new node, left = left->build(start, mid),
      right = right->build(mid + 1, end);
      val = left->val | right->val;
    }
    return this;
  }
  void lz(int start, int end) {
    if (lazy == 0) return;
    val = one << lazy;
    if (start != end) left->lazy = lazy, right->lazy = lazy;
    lazy = 0;
  }
  node* update(int start, int end, int a, int b, int v) {
    lz(start, end);
    int mid = (start + end) / 2;
    if (start >= a && end <= b) {
      lazy = v;
      lz(start, end);
    } else if (start > b || end < a)
      return this;
    else {
      left = left->update(start, mid, a, b, v);
      right = right->update(mid + 1, end, a, b, v);
      val = left->val | right->val;
    }
    return this;
  }
  long long query(int start, int end, int a, int b) {
    int mid = (start + end) / 2;
    lz(start, end);
    if (start >= a && end <= b)
      return val;
    else if (start > b || end < a)
      return 0;
    else
      return left->query(start, mid, a, b) | right->query(mid + 1, end, a, b);
  }
};
int cn(long long a) {
  int count = 0;
  while (a != 0) {
    count += a & 1;
    a >>= 1;
  }
  return count;
}
void dfs(int v, int p) {
  arrival[v] = ++timer;
  nd[arrival[v]] = v;
  for (auto c : adj[v]) {
    if (c != p) dfs(c, v);
  }
  departure[v] = timer;
}
int main() {
  int n, m, u, v, t, c;
  scanf("%d %d", &n, &m);
  for (int i = 1; i <= n; i++) {
    scanf("%d", col + i);
  }
  for (int i = 1; i < n; i++) {
    scanf("%d %d", &u, &v);
    adj[u].push_back(v), adj[v].push_back(u);
  }
  dfs(1, 0);
  node* root = new node;
  root = root->build(1, n);
  while (m--) {
    scanf("%d", &t);
    if (t == 1) {
      scanf("%d %d", &v, &c);
      root = root->update(1, n, arrival[v], departure[v], c);
    } else {
      scanf("%d", &v);
      printf("%d\n", cn(root->query(1, n, arrival[v], departure[v])));
    }
  }
}