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.*;
import java.lang.reflect.Array;
import java.math.BigInteger;
import java.util.*;


public class q5 {
	static int n,val;
	static ArrayList<Integer> gph[];
	static int[] colour;
	static int[][] range;
	static long pow[],assign[];
	
	
	static int dfs(int i,int p) {
		int min=Integer.MAX_VALUE;
		for(int j:gph[i]) {
			if(j!=p) {
				min=Math.min(min,dfs(j,i));
			}
		}
		
		assign[val]=pow[colour[i]];
		min=Math.min(min, val);
		range[i][0]=min;
		range[i][1]=val;
		val++;
		return min;
	}
	
	
	
	public static void main(String[] args) throws IOException {
		
		Reader.init(System.in);
		PrintWriter out=new PrintWriter(System.out);
		StringBuffer output=new StringBuffer("");
		n=Reader.nextInt();
		int m=Reader.nextInt();
		gph=new ArrayList[n+1];
		colour=new int[n+1];
		for(int i=1;i<=n;i++) gph[i]=new ArrayList<Integer>();
		for(int i=1;i<=n;i++) colour[i]=Reader.nextInt();
		for(int i=1;i<n;i++) {
			int a=Reader.nextInt(),b=Reader.nextInt();
			gph[a].add(b);gph[b].add(a);
		}
		pow=new long[61];
		pow[0]=1;
		for(int i=1;i<=60;i++) {
			pow[i]=2*pow[i-1];
		}
		
		val=0;
		assign=new long[n];
		range=new int[n+1][2];
		dfs(1,-1);
		//colour=new int[0];
		//gph=new ArrayList[0];
		Seg tree=new Seg(n);
		tree.build(0, 0, n-1);
		//assign=new int[0];
		while(m>0) {
			m--;
			int type=Reader.nextInt();
			if(type==1) {
				int v=Reader.nextInt();
				int c=Reader.nextInt();
				tree.update(0, 0, n-1, range[v][0], range[v][1], pow[c]);
				
			}
			else {
				int v=Reader.nextInt();
				long c=tree.query(0, 0, n-1, range[v][0], range[v][1]);
				out.println(Long.bitCount(c));
			}
		}
		out.flush();
	}
}



class NoD{
	
	int ans;
	boolean[] colour;
	
}

class Seg{
	long[] st;
	long[] lazy;
	
	
	Seg(int n){
		int memory=(int)Math.ceil((Math.log(n)/Math.log(2)));
		memory=(int)Math.pow(2, memory);
		memory*=2;
		st=new long[memory];
		lazy=new long[memory];
		
	}
	
	void build(int index, int low, int high) {
		if(low==high) {
			st[index]=q5.assign[low];
			
		}
		else {
			int middle=(low+high)/2;
			build(2*index+1,low,middle);
			build(2*index+2,middle+1,high);
			st[index]=st[2*index+1]|st[2*index+2];
		}
	}
	
	void update(int index, int low, int high, int ql, int qr,long val) {
		if(lazy[index]!=0) {
			st[index]=lazy[index];
			if(low<high) {
				lazy[2*index+1]=lazy[index];
				lazy[2*index+2]=lazy[index];
			}
			lazy[index]=0;
		}
		if(ql<=low && high<=qr) {
			st[index]=val;
			if(low<high) {
				lazy[2*index+1]=val;
				lazy[2*index+2]=val;
			}
		}
		else if(!(ql>high || qr<low)) {
			int middle=(low+high)/2;
			update(2*index+1,low,middle,ql,qr,val);
			update(2*index+2,middle+1,high,ql,qr,val);
			st[index]=st[2*index+1]|st[2*index+2];
		}
	}
	
	long query(int index,int low,int high,int ql,int qh) {
		if(lazy[index]!=0) {
			st[index]=lazy[index];
			if(low<high) {
				lazy[2*index+1]=lazy[index];
				lazy[2*index+2]=lazy[index];
			}
			lazy[index]=0;
		}
		if(ql<=low && high<=qh) {
			return st[index];
			
		}
		else if(!(ql>high || qh<low)) {
			int middle=(low+high)/2;
			long a=query(2*index+1,low,middle,ql,qh);
			long b=query(2*index+2,middle+1,high,ql,qh);
			st[index]=st[2*index+1]|st[2*index+2];
			return a|b;
		}
		return 0;
	}
	
	
	
	
}





class Reader {
    static BufferedReader reader;
    static StringTokenizer tokenizer;
    /** call this method to initialize reader for InputStream */
    static void init(InputStream input) {
        reader = new BufferedReader(
                     new InputStreamReader(input) );
        tokenizer = new StringTokenizer("");
    }
    /** get next word */
    static String nextLine() throws IOException{
    	return reader.readLine();
    }
    static String next() throws IOException {
        while ( ! tokenizer.hasMoreTokens() ) {
            //TODO add check for eof if necessary
            tokenizer = new StringTokenizer(
                   reader.readLine() );
        }
        return tokenizer.nextToken();
    }
    static int nextInt() throws IOException {
        return Integer.parseInt( next() );
    }
    static long nextLong() throws IOException {
        return Long.parseLong( next() );
    }
    static double nextDouble() throws IOException {
        return Double.parseDouble( next() );
    }
}