#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
struct node {
  int sw = 0;
  long long int col = 0;
};
vector<vector<int> > g;
vector<int> lr;
vector<int> rr;
vector<int> rex;
int t;
vector<int> used;
vector<int> c;
vector<node> tree;
void dfs(int v) {
  t++;
  used[v] = 1;
  lr[v] = t;
  rex[t] = v;
  for (int u : g[v]) {
    if (!used[u]) dfs(u);
  }
  rr[v] = t;
}
void relax(int i) { tree[i].col = (tree[2 * i].col | tree[2 * i + 1].col); }
void push(int i, int l, int r) {
  if (tree[i].sw) {
    tree[i].col = (1LL << tree[i].sw);
    if (l != r) {
      tree[2 * i + 1].sw = tree[i].sw;
      tree[2 * i].sw = tree[i].sw;
    }
    tree[i].sw = 0;
  }
}
void buildtree(int i, int l, int r) {
  if (l == r) {
    tree[i].col = (1LL << c[rex[l]]);
    return;
  }
  int m = (l + r) / 2;
  buildtree(2 * i, l, m);
  buildtree(2 * i + 1, m + 1, r);
  relax(i);
}
void upd(int i, int l, int r, int lx, int rx, int c) {
  push(i, l, r);
  if (l > rx || r < lx) return;
  if (l >= lx && r <= rx) {
    tree[i].sw = c;
    push(i, l, r);
    return;
  }
  int m = (l + r) / 2;
  upd(2 * i, l, m, lx, rx, c);
  upd(2 * i + 1, m + 1, r, lx, rx, c);
  relax(i);
}
long long int get(int i, int l, int r, int lx, int rx) {
  if (l > rx || r < lx) return 0LL;
  push(i, l, r);
  if (l >= lx && r <= rx) {
    return tree[i].col;
  }
  int m = (l + r) / 2;
  return get(2 * i, l, m, lx, rx) | get(2 * i + 1, m + 1, r, lx, rx);
  relax(i);
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, m;
  cin >> n >> m;
  n += 5;
  int mn = 32 - __builtin_clz(4 * n);
  tree.resize((1 << mn));
  lr.resize(n);
  rr.resize(n);
  g.resize(n);
  used.resize(n, 0);
  rex.resize(n);
  c.resize(n);
  n -= 5;
  for (int i = 1; i <= n; ++i) cin >> c[i];
  for (int i = 1; i < n; ++i) {
    int fr, to;
    cin >> fr >> to;
    g[fr].push_back(to);
    g[to].push_back(fr);
  }
  dfs(1);
  buildtree(1, 1, n);
  while (m--) {
    int t;
    cin >> t;
    if (t == 1) {
      int v, color;
      cin >> v >> color;
      upd(1, 1, n, lr[v], rr[v], color);
    } else {
      int v;
      cin >> v;
      int ans = __builtin_popcountll(get(1, 1, n, lr[v], rr[v]));
      cout << ans << "\n";
    }
  }
  return 0;
}
