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.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;
import java.util.Stack;
import java.util.StringTokenizer;

public class E {
	
	int n, m;
	
	List<List<Integer>> adj;
	int p[];
	long mask[];
	int col[];
	
	int tin[], tout[];
	
	int bitsUp(long mask) {
		int count = 0;
		while(mask > 0) {
			if((mask & 1) != 0) {
				count++;
			}
			mask >>= 1;
		}
		return count;
	}
	
	
	void dfs() {
		p[0] = 0;
		Stack<Integer> st = new Stack<>();
		st.add(0);
		
		while(!st.isEmpty()) {
			int top = st.pop();
			for(int child : adj.get(top)) {
				if(child != p[top]) {
					p[child] = top;
					st.add(child);
				}
			}
		}
	}
	
	int _t = 0;
	void eulerTour(int i) {
		tin[i] = _t++;
		
		for(int child : adj.get(i)) {
			if(child != p[i]) {
				eulerTour(child);
			}
		}
		
		tout[i] = _t;
	}
	
	SegmentTreeLazy st;
	
	public void solve(InputReader in, PrintWriter out) {
		n = in.nextInt();
		m = in.nextInt();
		
		adj = new ArrayList<>();
		p = new int[n];
		mask = new long[n];
		col = new int[n];
		
		for (int i = 0; i < n; i++) adj.add(new ArrayList<Integer>());
		
		for (int i = 0; i < n; i++) {
			col[i] = in.nextInt() - 1;
			mask[i] = (1L << col[i]);
		}
		
		for(int i = 0; i < n-1; i++) {
			int u, v;
			u = in.nextInt() - 1;
			v = in.nextInt() - 1;
			
			adj.get(u).add(v);
			adj.get(v).add(u);
		}
		
		dfs();
		
		tin = new int[n];
		tout = new int[n];
		eulerTour(0);
		
		long stContent[] = new long[n];
		for(int i = 0; i < n; i++) {
			stContent[tin[i]] = (1L << col[i]); 
		}
		st = new SegmentTreeLazy(stContent);
		
		for (int k = 0; k < m; k++) {
			int t, v, c;
			t = in.nextInt();
			
			if(t == 1) {
				v = in.nextInt() - 1;
				c = in.nextInt() - 1;
				
				st.update_tree(tin[v], tout[v]-1, (1L << c));
				
			} else {
				v = in.nextInt() - 1;
				long res = st.query_tree(tin[v], tout[v]-1);
				System.out.println(bitsUp(res));
			}
		}
    }
	
	public class SegmentTreeLazy {

		int N;
		int MAX = (1+(1<<6));
//		final int inf = 0x7fffffff;

		long arr[];
		long tree[];
		long lazy[];

		public SegmentTreeLazy(long _arr[]) {
			N = _arr.length;
			
			MAX = getSegmentTreeSize(N);
			
			tree = new long[MAX];
			lazy = new long[MAX];
			arr = _arr;
			
			build_tree(1, 0, arr.length - 1);
		}
		
		int getSegmentTreeSize(int x) {
		  int size = 1;
		  for (; size < x; size <<= 1);
		  return size << 1;
		}
		
		/**
		 * Build and init tree
		 */
		void build_tree(int node, int a, int b) {
		  	if(a > b) return; // Out of range
		  	
		  	if(a == b) { // Leaf node
		    		tree[node] = arr[a]; // Init value
				return;
			}
			
			build_tree(node*2, a, (a+b)/2); // Init left child
			build_tree(node*2+1, 1+(a+b)/2, b); // Init right child
			
			tree[node] = tree[node*2] | tree[node*2+1]; // Init root value
		}

		/**
		 * Increment elements within range [i, j] with value value
		 */
		void update_tree(int i, int j, long value) {
			update_tree(1, 0, arr.length-1, i, j, value);
		}
		/**
		 * Increment elements within range [i, j] with value value
		 */
		void update_tree(int node, int a, int b, int i, int j, long value) {
		  
		  	if(lazy[node] != 0) { // This node needs to be updated
		   		tree[node] = lazy[node]; // Update it

				if(a != b) {
					lazy[node*2] = lazy[node]; // Mark child as lazy
		    			lazy[node*2+1] = lazy[node]; // Mark child as lazy
				}

		   		lazy[node] = 0; // Reset it
		  	}
		  
			if(a > b || a > j || b < i) // Current segment is not within range [i, j]
				return;
		    
		  	if(a >= i && b <= j) { // Segment is fully within range
		    	tree[node] = value;

				if(a != b) { // Not leaf node
					lazy[node*2] = value;
					lazy[node*2+1] = value;
				}

				return;
			}

			update_tree(node*2, a, (a+b)/2, i, j, value); // Updating left child
			update_tree(1+node*2, 1+(a+b)/2, b, i, j, value); // Updating right child

			tree[node] = tree[node*2] | tree[node*2+1]; // Updating root with max value
		}

		/**
		 * Query tree to get max element value within range [i, j]
		 */
		long query_tree(int i, int j) {
			return query_tree(1, 0, arr.length - 1, i, j);
		}
		
		/**
		 * Query tree to get max element value within range [i, j]
		 */
		long query_tree(int node, int a, int b, int i, int j) {
			
			if(a > b || a > j || b < i) return 0; // Out of range

			if(lazy[node] != 0) { // This node needs to be updated
				tree[node] = lazy[node]; // Update it

				if(a != b) {
					lazy[node*2] = lazy[node]; // Mark child as lazy
					lazy[node*2+1] = lazy[node]; // Mark child as lazy
				}

				lazy[node] = 0; // Reset it
			}

			if(a >= i && b <= j) // Current segment is totally within range [i, j]
				return tree[node];

			long q1 = query_tree(node*2, a, (a+b)/2, i, j); // Query left child
			long q2 = query_tree(1+node*2, 1+(a+b)/2, b, i, j); // Query right child

			long res = q1 | q2; // Return final result
			
			return res;
		}

	}
	
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        E solver = new E();
        solver.solve(in, out);
        out.close();
    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        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 long nextLong() {
            return Long.parseLong(next());
        }
        
        public double nextDouble() {
            return Double.parseDouble(next());
        }
    }
}