#include <bits/stdc++.h>
using namespace std;
const long long N = 4e5 + 50, mod = 1e9 + 7;
int n, m, color[N], in[N], out[N], Node[N], id;
long long tree[4 * N], lazy[4 * N];
vector<int> g[N];
void dfs(int node, int par) {
  in[node] = ++id;
  Node[id] = node;
  for (auto i : g[node]) {
    if (i == par) continue;
    dfs(i, node);
  }
  out[node] = id;
}
void build(int node, int l, int r) {
  if (l == r) {
    tree[node] = (1LL << (color[Node[l]] - 1));
    return;
  }
  int mid = (l + r) / 2;
  build(node * 2, l, mid), build(node * 2 + 1, mid + 1, r);
  tree[node] = (tree[node * 2] | tree[node * 2 + 1]);
}
void propagate(int node, int l, int r) {
  if (lazy[node] == 0) return;
  tree[node] = lazy[node];
  if (l != r) {
    lazy[node * 2] = lazy[node];
    lazy[node * 2 + 1] = lazy[node];
  }
  lazy[node] = 0;
}
void update(int node, int l, int r, int st, int en, int val) {
  propagate(node, l, r);
  if (r < st || en < l) return;
  if (l >= st && r <= en) {
    lazy[node] = (1LL << val);
    propagate(node, l, r);
    return;
  }
  int mid = (l + r) / 2;
  update(node * 2, l, mid, st, en, val),
      update(node * 2 + 1, mid + 1, r, st, en, val);
  tree[node] = (tree[node * 2] | tree[node * 2 + 1]);
}
long long query(int node, int l, int r, int st, int en) {
  propagate(node, l, r);
  if (r < st || en < l) return 0ll;
  if (l >= st && r <= en) return tree[node];
  int mid = (l + r) / 2;
  return (query(node * 2, l, mid, st, en) |
          query(node * 2 + 1, mid + 1, r, st, en));
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m;
  for (int i = 1; i <= n; i++) cin >> color[i];
  int u, v;
  for (int i = 1; i < n; i++) {
    cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  dfs(1, -1);
  build(1, 1, n);
  int t, c, cnt;
  long long ans;
  while (m--) {
    cin >> t >> v;
    if (t == 1) {
      cin >> c;
      update(1, 1, n, in[v], out[v], c - 1);
    } else {
      ans = query(1, 1, n, in[v], out[v]);
      cnt = 0;
      for (int i = 0; i < 60; i++)
        if ((ans >> i) & 1) cnt++;
      cout << cnt << '\n';
    }
  }
}
