#include <bits/stdc++.h>
using namespace std;
long long int tr[4 * 400009], lazy[4 * 400009];
int in[400009], out[400009], ft[400009], tim, col[400009];
vector<int> adj[400009];
void dfs(int u, int p) {
  ft[tim] = u;
  in[u] = tim++;
  for (int v : adj[u]) {
    if (v != p) dfs(v, u);
  }
  out[u] = tim;
}
long long int build(long long int si, long long int second, long long int se) {
  if (second + 1 == se) {
    tr[si] = 1LL << col[ft[second]];
    return tr[si];
  }
  long long int m = (second + se) / 2;
  tr[si] = build(2 * si + 1, second, m) | build(2 * si + 2, m, se);
  return tr[si];
}
void update(int si, int second, int se, int l, int r, long long int c) {
  if (r <= second || se <= l) return;
  if (l <= second && se <= r) {
    tr[si] = c;
    lazy[si] = c;
    return;
  }
  if (lazy[si] != 0) {
    long long int ch = lazy[si];
    lazy[si] = 0;
    tr[2 * si + 1] = ch;
    tr[2 * si + 2] = ch;
    lazy[2 * si + 1] = ch;
    lazy[2 * si + 2] = ch;
  }
  int m = (se + second) / 2;
  update(2 * si + 1, second, m, l, r, c);
  update(2 * si + 2, m, se, l, r, c);
  tr[si] = tr[2 * si + 1] | tr[2 * si + 2];
}
long long int query(int si, int second, int se, int l, int r) {
  if (r <= second || se <= l) return 0;
  if (l <= second && se <= r) return tr[si];
  if (lazy[si] != 0) {
    long long int ch = lazy[si];
    lazy[si] = 0;
    tr[2 * si + 1] = ch;
    tr[2 * si + 2] = ch;
    lazy[2 * si + 1] = ch;
    lazy[2 * si + 2] = ch;
  }
  int m = (second + se) / 2;
  return query(2 * si + 1, second, m, l, r) | query(2 * si + 2, m, se, l, r);
}
void solve() {
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < n; i++) cin >> col[i];
  for (int i = 0; i < n - 1; i++) {
    int u, v;
    cin >> u >> v;
    u--;
    v--;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  dfs(0, -1);
  build(0, 0, n);
  for (int i = 0; i < m; i++) {
    int type;
    cin >> type;
    if (type == 1) {
      int vert, c;
      cin >> vert >> c;
      vert--;
      update(0, 0, n, in[vert], out[vert], 1LL << c);
    } else {
      int vert;
      cin >> vert;
      vert--;
      cout << __builtin_popcountll(query(0, 0, n, in[vert], out[vert])) << '\n';
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  solve();
}
