#include <bits/stdc++.h>
#pragma GCC optimize(2)
#pragma GCC optimize(3)
using namespace std;
inline long long read() {
  long long x = 0, neg = 1;
  char op = getchar();
  while (!isdigit(op)) {
    if (op == '-') neg = -1;
    op = getchar();
  }
  while (isdigit(op)) {
    x = 10 * x + op - '0';
    op = getchar();
  }
  return neg * x;
}
inline void print(long long x) {
  if (x < 0) {
    putchar('-');
    x = -x;
  }
  if (x >= 10) print(x / 10);
  putchar(x % 10 + '0');
}
const long long maxn = 4e5 + 10;
vector<long long> G[maxn];
long long n, c[maxn], q;
long long L[maxn], R[maxn], tot, dfn[maxn];
void dfs(long long u, long long par) {
  L[u] = ++tot;
  dfn[tot] = u;
  for (auto to : G[u]) {
    if (to == par) continue;
    dfs(to, u);
  }
  R[u] = tot;
}
struct SegmentTree {
  struct Node {
    long long l, r, res, lazy;
  } tr[maxn * 4];
  inline void push_up(long long index) {
    tr[index].res = tr[(index << 1)].res | tr[(index << 1 | 1)].res;
  }
  inline void push_down(long long index) {
    if (tr[index].lazy) {
      tr[(index << 1)].res = tr[(index << 1 | 1)].res = tr[(index << 1)].lazy =
          tr[(index << 1 | 1)].lazy = tr[index].lazy;
      tr[index].lazy = 0;
    }
  }
  void build(long long index, long long l, long long r) {
    tr[index].l = l, tr[index].r = r;
    if (l == r) {
      tr[index].res = (1ll << c[dfn[l]]);
      return;
    }
    long long mid = (l + r) >> 1;
    build((index << 1), l, mid);
    build((index << 1 | 1), mid + 1, r);
    push_up(index);
  }
  void change(long long index, long long l, long long r, long long val) {
    if (tr[index].l >= l && tr[index].r <= r) {
      tr[index].res = 1ll << val;
      tr[index].lazy = 1ll << val;
      return;
    }
    push_down(index);
    long long mid = (tr[index].l + tr[index].r) >> 1;
    if (r <= mid)
      change((index << 1), l, r, val);
    else if (l > mid)
      change((index << 1 | 1), l, r, val);
    else {
      change((index << 1), l, mid, val);
      change((index << 1 | 1), mid + 1, r, val);
    }
    push_up(index);
  }
  long long query(long long index, long long l, long long r) {
    if (tr[index].l >= l && tr[index].r <= r) {
      return tr[index].res;
    }
    push_down(index);
    long long mid = (tr[index].l + tr[index].r) >> 1;
    if (r <= mid)
      return query((index << 1), l, r);
    else if (l > mid)
      return query((index << 1 | 1), l, r);
    else
      return query((index << 1), l, mid) | query((index << 1 | 1), mid + 1, r);
  }
} smt;
signed main() {
  n = read(), q = read();
  for (long long i = 1; i <= n; i++) c[i] = read();
  for (long long i = 1; i <= n - 1; i++) {
    long long u = read(), v = read();
    G[u].push_back(v);
    G[v].push_back(u);
  }
  tot = 0;
  dfs(1, 0);
  smt.build(1, 1, tot);
  while (q--) {
    long long op = read();
    if (op == 1) {
      long long u = read(), x = read();
      smt.change(1, L[u], R[u], x);
    } else {
      long long u = read();
      long long now = smt.query(1, L[u], R[u]);
      long long ans = 0;
      for (long long i = 1; i <= 60; i++)
        if ((now >> i) & 1) ans++;
      print(ans);
      puts("");
    }
  }
  return 0;
}
