The New Year holidays are over, but Resha doesn't want to throw away the New Year tree. He invited his best friends Kerim and Gural to help him to redecorate the New Year tree.

The New Year tree is an undirected tree with n vertices and root in the vertex 1.

You should process the queries of the two types:

  1. Change the colours of all vertices in the subtree of the vertex v to the colour c. 
  2. Find the number of different colours in the subtree of the vertex v. 

Input

The first line contains two integers n, m (1 ≤ n, m ≤ 4·105) — the number of vertices in the tree and the number of the queries.

The second line contains n integers ci (1 ≤ ci ≤ 60) — the colour of the i-th vertex.

Each of the next n - 1 lines contains two integers xj, yj (1 ≤ xj, yj ≤ n) — the vertices of the j-th edge. It is guaranteed that you are given correct undirected tree.

The last m lines contains the description of the queries. Each description starts with the integer tk (1 ≤ tk ≤ 2) — the type of the k-th query. For the queries of the first type then follows two integers vk, ck (1 ≤ vk ≤ n, 1 ≤ ck ≤ 60) — the number of the vertex whose subtree will be recoloured with the colour ck. For the queries of the second type then follows integer vk (1 ≤ vk ≤ n) — the number of the vertex for which subtree you should find the number of different colours.

Output

For each query of the second type print the integer a — the number of different colours in the subtree of the vertex given in the query.

Each of the numbers should be printed on a separate line in order of query appearing in the input.

Examples

Input

7 10
1 1 1 1 1 1 1
1 2
1 3
1 4
3 5
3 6
3 7
1 3 2
2 1
1 4 3
2 1
1 2 5
2 1
1 6 4
2 1
2 2
2 3


Output

2
3
4
5
1
2


Input

23 30
1 2 2 6 5 3 2 1 1 1 2 4 5 3 4 4 3 3 3 3 3 4 6
1 2
1 3
1 4
2 5
2 6
3 7
3 8
4 9
4 10
4 11
6 12
6 13
7 14
7 15
7 16
8 17
8 18
10 19
10 20
10 21
11 22
11 23
2 1
2 5
2 6
2 7
2 8
2 9
2 10
2 11
2 4
1 12 1
1 13 1
1 14 1
1 15 1
1 16 1
1 17 1
1 18 1
1 19 1
1 20 1
1 21 1
1 22 1
1 23 1
2 1
2 5
2 6
2 7
2 8
2 9
2 10
2 11
2 4


Output

6
1
3
3
2
1
2
3
5
5
1
2
2
1
1
1
2
3
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.Reader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.io.BufferedReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Ruins He
 */
public class Main {
  public static void main(String[] args) {
    InputStream inputStream = System.in;
    OutputStream outputStream = System.out;
    InputReader in = new InputReader(inputStream);
    OutputWriter out = new OutputWriter(outputStream);
    TaskE solver = new TaskE();
    solver.solve(1, in, out);
    out.close();
  }

  static class TaskE {
    private int[] l;
    private int[] r;
    private int[] idx;
    private int K;
    private int[] colors;
    private Graph tree;

    public void solve(int testNumber, InputReader in, OutputWriter out) {
      int n = in.nextInt();
      int m = in.nextInt();
      tree = new Graph(n);
      colors = in.nextInts(n);
      l = new int[n];
      r = new int[n];
      idx = new int[n + 1];
      K = 0;
      for (int i = 1; i < n; i++) {
        int u = in.nextInt() - 1;
        int v = in.nextInt() - 1;
        tree.addEdge(u, v);
        tree.addEdge(v, u);
      }
      dfs(0);
      Node root = build(1, n);
      for (int i = 0; i < m; i++) {
        int op = in.nextInt();
        int u = in.nextInt() - 1;
        if (op == 1) {
          int color = in.nextInt();
          root = update(root, l[u], r[u], color);
        } else {
          Node result = query(root, l[u], r[u]);
          out.println(Long.bitCount(result.color));
        }
      }
    }

    private Node query(Node node, int l, int r) {
      if (node.l == l && node.r == r) {
        return node;
      }
      node.update();
      int mid = node.lhs.r;
      if (r <= mid) {
        return query(node.lhs, l, r);
      } else if (l > mid) {
        return query(node.rhs, l, r);
      } else {
        return query(node.lhs, l, mid).add(query(node.rhs, mid + 1, r));
      }
    }

    private Node update(Node node, int l, int r, int color) {
      if (node.l > r || node.r < l) {
        return node;
      }
      if (node.l >= l && node.r <= r) {
        node.color = 1L << color;
        node.same = true;
        return node;
      }
      node.update();
      Node lhs = update(node.lhs, l, r, color);
      Node rhs = update(node.rhs, l, r, color);
      return lhs.add(rhs);
    }

    private Node build(int l, int r) {
      if (l == r) {
        return new Node(l, r, 1L << colors[idx[l]], null, null);
      } else {
        int mid = (l + r) >> 1;
        return build(l, mid).add(build(mid + 1, r));
      }
    }

    private void dfs(int u) {
      l[u] = ++K;
      idx[K] = u;
      for (int v : tree.adj(u)) {
        if (l[v] == 0) {
          dfs(v);
        }
      }
      r[u] = K;
    }

    private class Node {
      int l;
      int r;
      long color;
      Node lhs;
      Node rhs;
      boolean same;

      public Node(int l, int r, long color, Node lhs, Node rhs) {
        this.l = l;
        this.r = r;
        this.color = color;
        this.lhs = lhs;
        this.rhs = rhs;
        same = false;
      }

      public Node add(Node other) {
        return new Node(l, other.r, color | other.color, this, other);
      }

      public void update() {
        if (same) {
          update(lhs);
          update(rhs);
          same = false;
        }
      }

      private void update(Node child) {
        child.color = color;
        child.same = true;
      }

    }

  }

  static class InputReader {
    public final BufferedReader reader;
    public StringTokenizer tokenizer = null;

    public InputReader(Reader reader) {
      this.reader = new BufferedReader(reader, 32767);
    }

    public InputReader(InputStream inputStream) {
      this(new InputStreamReader(inputStream));
    }

    public String next() {
      while (tokenizer == null || !tokenizer.hasMoreTokens()) {
        try {
          tokenizer = new StringTokenizer(reader.readLine());
        } catch (IOException e) {
          throw new RuntimeException(e);
        }
      }
      return tokenizer.nextToken();
    }

    public int nextInt() {
      return Integer.parseInt(next());
    }

    public int[] nextInts(int n) {
      int[] res = new int[n];
      for (int i = 0; i < n; i++) res[i] = nextInt();
      return res;
    }

  }

  static class Graph {
    private final List<Integer>[] edges;
    public final int n;
    private int m = 0;

    @SuppressWarnings("unchecked")
    public Graph(int n) {
      this.n = n;
      this.edges = new List[n];
      for (int i = 0; i < n; i++) {
        edges[i] = new ArrayList<>();
      }
    }

    public void addEdge(int u, int v) {
      edges[u].add(v);
      m++;
    }

    public int adjSize(int u) {
      return edges[u].size();
    }

    public Iterable<Integer> adj(int u) {
      return edges[u];
    }


    public String toString() {
      StringBuilder stringBuilder = new StringBuilder();
      stringBuilder.append("graph with ").append(n).append(" nodes ");
      int res = 0;
      for (int i = 0; i < n; i++) res += adjSize(i);
      stringBuilder.append(res / 2).append(" edges\n");
      for (int u = 0; u < n; u++) {
        for (int v : adj(u)) {
          if (u < v) {
            stringBuilder.append(u).append(" ").append(v).append("\n");
          }
        }
      }
      return stringBuilder.toString();
    }

  }

  static class OutputWriter {
    private final PrintWriter writer;

    private OutputWriter(Writer writer, boolean autoFlush) {
      this.writer = new PrintWriter(new BufferedWriter(writer, 32767), autoFlush);
    }

    public OutputWriter(Writer writer) {
      this(writer, true);
    }

    public OutputWriter(OutputStream outputStream) {
      this(new OutputStreamWriter(outputStream), false);
    }

    public OutputWriter println(int value) {
      writer.println(value);
      return this;
    }

    public void close() {
      writer.close();
    }

  }
}

