Problem: 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

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.StringTokenizer;

public class NewYearTree {
	static int idx;
	static int per[];
	static int pos[];
	static ArrayList<Integer> adjList[];
	static int p[];
	static int size[];
	static int[] c;
	static int dfs(int u)
	{
		pos[u] = idx;
		per[idx++] = u;
		int count = 1;
		for(int v : adjList[u])
			if(v != p[u])
			{
				p[v] = u;
				count += dfs(v);
			}
		return size[u] = count;
	}
	public static void main(String[] args) throws NumberFormatException, IOException {
		Scanner sc = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		
		int n = sc.nextInt();
		int m = sc.nextInt();
		c = new int[n];
		p = new int[n];
		pos = new int[n+1];
		size = new int[n];
		Arrays.fill(p, -1);
		
		for(int i=0; i<n; i++)
			c[i] = sc.nextInt();
		
		adjList = new ArrayList[n];
		for(int i=0; i<n; i++)
			adjList[i] = new ArrayList<Integer>();
		
		for(int i=1; i<n; i++)
		{
			int v1 = sc.nextInt()-1;
			int v2 = sc.nextInt()-1;
			adjList[v1].add(v2);
			adjList[v2].add(v1);
		}
		
		idx = 1;
		int N = 1;
		while(N < n)
			N *= 2;
		per = new int[N+1];
		dfs(0);
		
		SegmentTree tree = new SegmentTree(per);
		
		for(int i=0; i<m; i++)
		{
			int t = sc.nextInt();
			int v = sc.nextInt()-1;
			if(t == 2)
			{
				out.println(Long.bitCount(tree.query(pos[v], pos[v]+size[v]-1)));
			}
			else {
				int c = sc.nextInt();
				tree.update_range(pos[v], pos[v]+size[v]-1, c);
			}
		}
		out.flush();
		
	}
	static class Node{
		int u;
		long c;
		public Node(int x, long y){
			u = x; c = y;
		}
	}
	static class SegmentTree {		// 1-based DS, OOP
		
		int N; 			//the number of elements in the array as a multipls of 2 (i.e. after padding)
		int[] array;
		long[] sTree, lazy;
		
		SegmentTree(int[] in)		
		{
			array = in; N = in.length - 1;
			sTree = new long[N<<1];		//no. of nodes = 2*N - 1, we add one to cross out index zero
			lazy = new long[N<<1];
			build(1,1,N);
		}
		
		void build(int node, int b, int e)	// O(n)
		{
			if(b == e)					
				sTree[node] = 1L << c[array[b]];
			else						
			{
				build(node<<1,b,(b+e)/2);
				build((node<<1)+1,(b+e)/2+1,e);
				sTree[node] = sTree[node<<1] | sTree[(node<<1)+1];
			}
		}
		
		
		void update_range(int i, int j, int val)		// O(log n) 
		{
			update_range(1,1,N,i,j,val);
		}
		
		void update_range(int node, int b, int e, int i, int j, int val)
		{
			if(i > e || j < b)		
				return;
			if(b >= i && e <= j)		
			{
				sTree[node] = (1L << val);			
				lazy[node] = (1L << val);				
			}							
			else		
			{
				propagate(node, b, e);
				update_range(node<<1,b,(b+e)/2,i,j,val);
				update_range((node<<1)+1,(b+e)/2+1,e,i,j,val);
				sTree[node] = sTree[node<<1] | sTree[(node<<1)+1];		
			}
			
		}
		void propagate(int node, int b, int e)		
		{
			if(lazy[node] != 0){
				lazy[node<<1] = lazy[node];
				lazy[(node<<1)+1] = lazy[node];
				sTree[node<<1] = lazy[node];		
				sTree[(node<<1)+1] = lazy[node];		
				lazy[node] = 0;
			}
		}
		
		long query(int i, int j)
		{
			return query(1,1,N,i,j);
		}
		
		long query(int node, int b, int e, int i, int j)	// O(log n)
		{
			if(i>e || j <b)
				return 0;		
			if(b>= i && e <= j)
				return sTree[node];
			propagate(node, b, e);
			return query(node<<1,b,(b+e)/2,i,j) | query((node<<1)+1,(b+e)/2+1,e,i,j);	
					
		}
	}
	
	static class Scanner {
		BufferedReader br;
		StringTokenizer st;

		Scanner(FileReader f) {
			br = new BufferedReader(f);
		}

		public boolean ready() throws IOException {
			return br.ready();
		}

		Scanner(InputStream s) {
			br = new BufferedReader(new InputStreamReader(s));
		}

		String next() throws IOException {
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}

		String nextLine() throws IOException {
			return br.readLine();
		}

		int nextInt() throws NumberFormatException, IOException {
			return Integer.parseInt(next());
		}

		long nextLong() throws NumberFormatException, IOException {
			return Long.parseLong(next());
		}
	}
}