#include <bits/stdc++.h>
using namespace std;
template <class T>
void dbs(string str, T t) {
  cerr << str << " : " << t << "\n";
}
template <class T, class... S>
void dbs(string str, T t, S... s) {
  int idx = str.find(',');
  cerr << str.substr(0, idx) << " : " << t << ",";
  dbs(str.substr(idx + 1), s...);
}
template <class S, class T>
ostream& operator<<(ostream& os, const pair<S, T>& p) {
  return os << "(" << p.first << ", " << p.second << ")";
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& p) {
  os << "[ ";
  for (auto& it : p) os << it << " ";
  return os << "]";
}
template <class T>
ostream& operator<<(ostream& os, const set<T>& p) {
  os << "[ ";
  for (auto& it : p) os << it << " ";
  return os << "]";
}
template <class S, class T>
ostream& operator<<(ostream& os, const map<S, T>& p) {
  os << "[ ";
  for (auto& it : p) os << it << " ";
  return os << "]";
}
template <class T>
void prc(T a, T b) {
  cerr << "[";
  for (T i = a; i != b; ++i) {
    if (i != a) cerr << ", ";
    cerr << *i;
  }
  cerr << "]\n";
}
const int N = 400010;
vector<int> Adj[N + 1];
long long colorVal[4 * N + 1];
int dfs_timer = 1;
int begin1[N + 1];
int size1[N + 1];
int initColor[N + 1];
class SegTree {
 public:
  vector<long long> colors;
  vector<bool> lazyp;
  vector<long long> lazyColor;
  SegTree(int n) {
    colors.resize(4 * n + 1);
    lazyp.resize(4 * n + 1);
    lazyColor.resize(4 * n + 1);
    build(1, 1, n);
  }
  void build(int node, int b, int e) {
    if (b > e) return;
    if (b == e) {
      colors[node] = 0, lazyColor[node] = 0, lazyp[node] = false;
      return;
    }
    build(2 * node, b, (b + e) / 2);
    build(2 * node + 1, (b + e) / 2 + 1, e);
  }
  void push(int node, int b, int e) {
    if (lazyColor[node] == 0) return;
    colors[node] = 0;
    colors[node] |= (1LL << lazyColor[node]);
    if (b != e) {
      lazyColor[2 * node] = lazyColor[node];
      lazyColor[2 * node + 1] = lazyColor[node];
    }
    lazyColor[node] = 0;
  }
  void update(int node, int b, int e, int i, int j, int color) {
    push(node, b, e);
    if (b > e || i > e || j < b) return;
    if (i <= b and e <= j) {
      lazyColor[node] = color;
      push(node, b, e);
      return;
    }
    update(2 * node, b, (b + e) / 2, i, j, color);
    update(2 * node + 1, (b + e) / 2 + 1, e, i, j, color);
    colors[node] = (colors[2 * node] | colors[2 * node + 1]);
    return;
  }
  long long query(int node, int b, int e, int i, int j) {
    push(node, b, e);
    if (b > e || i > e || j < b) return 0LL;
    if (i <= b and e <= j) {
      return colors[node];
    }
    long long colLeft = query(2 * node, b, (b + e) / 2, i, j);
    long long colRight = query(2 * node + 1, (b + e) / 2 + 1, e, i, j);
    colors[node] = (colors[2 * node] | colors[2 * node + 1]);
    long long answers = (colLeft | colRight);
    return answers;
  }
};
void DFS(int u, int p) {
  begin1[u] = dfs_timer++;
  size1[u] = 1;
  for (auto v : Adj[u]) {
    if (v != p) {
      DFS(v, u);
      size1[u] += size1[v];
    }
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, m;
  cin >> n >> m;
  for (int i = (int)(1); i <= (int)(n); i++) {
    int temp;
    cin >> temp;
    initColor[i] = temp;
  }
  SegTree st(n);
  for (int i = (int)(1); i <= (int)(n - 1); i++) {
    int a1, b1;
    cin >> a1 >> b1;
    Adj[a1].push_back(b1), Adj[b1].push_back(a1);
  }
  DFS(1, 0);
  for (int i = (int)(1); i <= (int)(n); i++) {
    st.update(1, 1, n, begin1[i], begin1[i], initColor[i]);
  }
  while (m--) {
    int tp;
    cin >> tp;
    if (tp == 1) {
      int vk, ck;
      cin >> vk >> ck;
      st.update(1, 1, n, begin1[vk], begin1[vk] + size1[vk] - 1, ck);
    } else {
      int vk;
      cin >> vk;
      long long answer1 =
          st.query(1, 1, n, begin1[vk], begin1[vk] + size1[vk] - 1);
      cout << __builtin_popcountll(answer1) << "\n";
    }
  }
  return 0;
}
