#include <bits/stdc++.h>
using namespace std;
const int MAXN = 400001;
long long tree[4 * MAXN];
long long prop[4 * MAXN];
void push(int i, int l, int r) {
  if (prop[i] != -1) {
    if (l != r) {
      prop[i * 2] = prop[i * 2 + 1] = prop[i];
      tree[i * 2] = tree[i * 2 + 1] = prop[i];
    }
    tree[i] = prop[i];
    prop[i] = -1;
  }
}
long long get(int i, int l, int r, int ql, int qr) {
  push(i, l, r);
  if (l == ql && r == qr) return tree[i];
  int m = (l + r) / 2;
  long long res = 0;
  if (ql <= m) res |= get(i * 2, l, m, ql, min(qr, m));
  if (qr > m) res |= get(i * 2 + 1, m + 1, r, max(ql, m + 1), qr);
  return res;
}
void assign(int i, int l, int r, int ql, int qr, long long x) {
  push(i, l, r);
  if (l == ql && r == qr) {
    prop[i] = x;
    push(i, l, r);
  } else {
    int m = (l + r) / 2;
    if (ql <= m) assign(i * 2, l, m, ql, min(qr, m), x);
    if (qr > m) assign(i * 2 + 1, m + 1, r, max(ql, m + 1), qr, x);
    tree[i] = tree[i * 2] | tree[i * 2 + 1];
  }
}
void build(vector<long long> &a, int i, int l, int r) {
  prop[i] = -1;
  if (l == r) {
    tree[i] = a[l];
  } else {
    int m = (l + r) / 2;
    build(a, i * 2, l, m);
    build(a, i * 2 + 1, m + 1, r);
    tree[i] = tree[i * 2] | tree[i * 2 + 1];
  }
}
long long c[MAXN];
vector<int> g[MAXN];
int tin[MAXN], tout[MAXN];
vector<long long> eulerCode;
void dfs(int v, int p = -1) {
  eulerCode.push_back(c[v]);
  tin[v] = eulerCode.size() - 1;
  for (int e : g[v])
    if (e != p) dfs(e, v);
  tout[v] = eulerCode.size() - 1;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < n; ++i) {
    cin >> c[i];
    c[i] = 1LL << c[i];
  }
  int u, v;
  for (int i = 0; i < n - 1; ++i) {
    cin >> u >> v;
    u--, v--;
    g[v].push_back(u);
    g[u].push_back(v);
  }
  eulerCode = {-1};
  dfs(0);
  build(eulerCode, 1, 1, n);
  int t;
  long long c;
  while (m--) {
    cin >> t;
    if (t == 1) {
      cin >> v >> c;
      v--;
      c = 1LL << c;
      assign(1, 1, n, tin[v], tout[v], c);
    } else {
      cin >> v;
      v--;
      long long res = get(1, 1, n, tin[v], tout[v]);
      cout << __builtin_popcountll(res) << "\n";
    }
  }
}
