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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;


public class ProblemE {

	public static int n, m;
	public static long[] c;
	public static List<Integer>[] edge;
	public static int[] order;
	public static int orderIndex;
	public static Interval[] subtree;
	
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter out = new PrintWriter(System.out);
		String[] buffer = in.readLine().split(" ");
		n = Integer.parseInt(buffer[0]);
		m = Integer.parseInt(buffer[1]);
		c = new long[n + 1];
		buffer = in.readLine().split(" ");
		for (int i = 1; i <= n; i++) {
			c[i] = 1L << Integer.parseInt(buffer[i - 1]);
		}
		edge = new List[n + 1];
		for (int i = 1; i <= n; i++) {
			edge[i] = new ArrayList<Integer>();
		}
		for (int i = 1; i < n; i++) {
			buffer = in.readLine().split(" ");
			int x = Integer.parseInt(buffer[0]);
			int y = Integer.parseInt(buffer[1]);
			edge[x].add(y);
			edge[y].add(x);
		}
		order = new int[n + 1];
		orderIndex = 1;
		subtree = new Interval[n + 1];
		dfs(1, 0);
		IntervalTree tree = new IntervalTree(n);
		tree.build(1, 1, n);
		while (m-- > 0) {
			buffer = in.readLine().split(" ");
			int t = Integer.parseInt(buffer[0]);
			if (t == 1) {
				int vi = Integer.parseInt(buffer[1]);
				long ci = 1L << Integer.parseInt(buffer[2]);
				tree.color(1, subtree[vi], ci);
			} else {
				int vi = Integer.parseInt(buffer[1]);
				long result = tree.find(1, subtree[vi]);
				out.println(getOnes(result));
			}
		}
		in.close();
		out.close();
	}
	
	public static void dfs(int cnt, int parent) {
		order[orderIndex] = cnt;
		subtree[cnt] = new Interval();
		subtree[cnt].left = orderIndex++;
		for (Integer next : edge[cnt]) {
			if (next != parent) {
				dfs(next, cnt);
			}
		}
		subtree[cnt].right = orderIndex - 1;
	}
	
	public static int getOnes(long state) {
		int count = 0;
		while (state > 0) {
			state &= state - 1;
			count++;
		}
		return count;
	}
	
	public static class Interval {
		public int left, right;
	}
	
	public static class IntervalTree {
		public Node[] body;
		public IntervalTree(int length) {
			body = new Node[length << 2];
		}
		public void build(int index, int left, int right) {
			body[index] = new Node(left, right);
			if (left < right) {
				int mid = (left + right) >>> 1;
				build(index << 1, left, mid);
				build(index << 1 | 1, mid + 1, right);
				aggregate(index);
			} else {
				body[index].isLazy = true;
				body[index].color = c[order[left]];
			}
		}
		public void color(int index, Interval interval, long color) {
			if (disjoint(index, interval)) {
				return;
			}
			if (cover(index, interval)) {
				body[index].isLazy = true;
				body[index].color = color;
				return;
			}
			distribute(index);
			color(index << 1, interval, color);
			color(index << 1 | 1, interval, color);
			aggregate(index);
		}
		public long find(int index, Interval interval) {
			if (disjoint(index, interval)) {
				return 0;
			}
			if (cover(index, interval)) {
				return body[index].color;
			}
			distribute(index);
			long result = find(index << 1, interval);
			result |= find(index << 1 | 1, interval);
			aggregate(index);
			return result;
		}
		public boolean disjoint(int index, Interval interval) {
			return interval.right < body[index].left || interval.left > body[index].right;
		}
		public boolean cover(int index, Interval interval) {
			return interval.left <= body[index].left && interval.right >= body[index].right;
		}
		public void distribute(int index) {
			if (body[index].isLazy) {
				body[index << 1].isLazy = body[index << 1 | 1].isLazy = true;
				body[index << 1].color = body[index << 1 | 1].color = body[index].color;
				body[index].isLazy = false;
			}
		}
		public void aggregate(int index) {
			body[index].color = body[index << 1].color | body[index << 1 | 1].color;
		}
		public static class Node {
			public int left, right;
			public boolean isLazy;
			public long color;
			public Node(int left, int right) {
				this.left = left;
				this.right = right;
			}
		}
	}

}
