#include <bits/stdc++.h>
using namespace std;
struct Node {
  long long val, lazy;
  bool tag;
};
struct SegmentTree {
  vector<Node> st;
  long long n;
  SegmentTree() {}
  SegmentTree(long long _n) {
    this->n = _n;
    st.assign(4 * n + 5, {0, 0, 0});
  }
  long long Left(long long x) { return (x << 1); }
  long long Right(long long x) { return (x << 1) + 1; }
  void push(long long id) {
    st[Left(id)].tag = true;
    st[Left(id)].val = st[Left(id)].lazy = st[id].lazy;
    st[Right(id)].tag = true;
    st[Right(id)].val = st[Right(id)].lazy = st[id].lazy;
    st[id].tag = false;
  }
  void update(long long id, long long L, long long R, long long i, long long j,
              long long val) {
    if (L > j || R < i) return;
    if (L >= i && R <= j) {
      st[id].tag = true;
      st[id].val = st[id].lazy = (1LL << val);
      return;
    }
    long long mid = (L + R) >> 1;
    if (st[id].tag) push(id);
    update(Left(id), L, mid, i, j, val);
    update(Right(id), mid + 1, R, i, j, val);
    st[id].val = st[Left(id)].val | st[Right(id)].val;
  }
  long long query(long long id, long long L, long long R, long long i,
                  long long j) {
    if (L > j || R < i) return 0;
    if (L >= i && R <= j) return st[id].val;
    long long mid = (L + R) >> 1;
    if (st[id].tag) push(id);
    return query(Left(id), L, mid, i, j) | query(Right(id), mid + 1, R, i, j);
  }
  long long get(long long l, long long r) {
    return __builtin_popcountll(query(1, 1, n, l, r));
  }
  void update(long long i, long long j, long long val) {
    update(1, 1, n, i, j, val);
  }
};
const long long N = 4e5 + 5;
long long n, m, c[N], dfsTime, tin[N], tout[N];
vector<long long> adj[N];
void dfs(long long u, long long pre) {
  tin[u] = ++dfsTime;
  for (long long v : adj[u]) {
    if (v == pre) continue;
    dfs(v, u);
  }
  tout[u] = ++dfsTime;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m;
  for (long long i = 1; i <= n; ++i) cin >> c[i];
  for (long long i = 1; i < n; ++i) {
    long long u, v;
    cin >> u >> v;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  dfs(1, -1);
  SegmentTree IT(dfsTime);
  for (long long i = 1; i <= n; ++i) IT.update(tin[i], tin[i], c[i]);
  for (long long i = 1; i <= m; ++i) {
    long long type;
    cin >> type;
    if (type == 1) {
      long long v, d;
      cin >> v >> d;
      IT.update(tin[v], tout[v], d);
    } else {
      long long v;
      cin >> v;
      cout << IT.get(tin[v], tout[v]) << endl;
    }
  }
  return 0;
}
