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.util.*;
public class q2 {
	static int n;
	static int[] color;
	static boolean[] visited;
	static int[] ss;
	static int[] ee;
	static ArrayList<Integer> g[];
	static int count=0;
	static int[] co;
	static long[] segment;
	static boolean[] lazy;
	static int[] fu;
	static long[] pow;
	public static void main(String[] args) throws Exception
	{
		InputReader in=new InputReader(System.in);
		PrintWriter pw=new PrintWriter(System.out);
		int n=in.nextInt();
		int m=in.nextInt();
		g=new ArrayList[n];
		color=new int[n];
		pow=new long[62];
		pow[0]=1;
		for(int i=1;i<=60;i++)
		{
			pow[i]=pow[i-1]*2;
		}
		visited=new boolean[n];
		ss=new int[n];
		ee=new int[n];
		fu=new int[4*n];
		co=new int[n];
		lazy=new boolean[4*n];
		segment=new long[4*n];
		for(int i=0;i<n;i++)
		{
			color[i]=in.nextInt();
			g[i]=new ArrayList<Integer>();
		}
		for(int i=0;i<n-1;i++)
		{
			int u=in.nextInt()-1;
			int v=in.nextInt()-1;
			g[u].add(v);
			g[v].add(u);
		}
		dfs(0,-1);
		initialize(0,0,n-1);
		for(int i=0;i<m;i++)
		{
		int type=in.nextInt();
		if(type==1)
		{
			int x=in.nextInt()-1;
			int co=in.nextInt();
			update(0,0,n-1,ss[x],ee[x],co);
		}
		else
		{
			int x=in.nextInt()-1;
			long arr=query(0,0,n-1,ss[x],ee[x]);
			//int count=0;
			
			pw.println(Long.bitCount(arr));
		}
		}
		
		pw.close();
	}
	public static void dfs(int x,int p)
	{
		visited[x]=true;
		//count++;
		ss[x]=count;
		
		for(int i=0;i<g[x].size();i++)
		{
			int v=g[x].get(i);
			if(!visited[v])
			{
				count++;
					dfs(v,x);
					for(int k=1;k<=60;k++)
					{
				//		temp[k]|=dp[v][k];
					}
					
			}
		}
		boolean[] temp=new boolean[61];
		temp[color[x]]=true;
		co[ss[x]]=color[x];
		ee[x]=count;

	}
	public static void initialize(int c,int start,int end)
	{
		if(start==end)
		{
			segment[c]|=pow[co[start]];
			//System.out.println("start   "+start+" end"+end+" segmet is"+segment[c]);
			return;
		}
		int mid=(start+end)/2;
		initialize(2*c+1,start,mid);
		initialize(2*c+2,mid+1,end);
		segment[c]|=segment[2*c+1];
		segment[c]|=segment[2*c+2];
		//System.out.println("start   "+start+" end"+end+" segmet is"+segment[c]);
		
	}
	public static boolean[] merge(boolean[] a,boolean[] b)
	{
		boolean[] ans=new boolean[61];
		for(int i=1;i<=60;i++)
		{
			ans[i]|=a[i];
			ans[i]|=b[i];
		}
		return ans;
	}
	public static void propgate(int c,int start,int end)
	{
		if(start!=end)
		{
			lazy[2*c+1]=true;
			lazy[2*c+2]=true;
			fu[2*c+1]=fu[c];
			fu[2*c+2]=fu[c];
		}

		//temp[fu[c]]=true;
		segment[c]=pow[fu[c]];
		lazy[c]=false;
	}
	public static long query(int c,int start,int end,int l,int r)
	{
		
		
		if(lazy[c])
		{
			//boolean[] temp=new boolean[61];
			//temp[fu[c]]=true;
			segment[c]=pow[fu[c]];
			lazy[c]=false;
			if(start!=end)
			{
				lazy[2*c+1]=true;
				lazy[2*c+2]=true;
				fu[2*c+1]=fu[c];
				fu[2*c+2]=fu[c];
			}
		}
		//boolean[] temp=new boolean[61];
		if(start>end || start>r || end<l)
		{
			return 0;
		}
		if(l<=start && r>=end)
		{
			return segment[c];
		}
		int mid=(start+end)/2;
		
		return query(2*c+1,start,mid,l,r)|query(2*c+2,mid+1,end,l,r);
	}
	public static void update(int c,int start,int end,int l,int r,int col)
	{
		
		if(lazy[c])
		{
			//boolean[] temp=new boolean[61];
			//temp[fu[c]]=true;
			segment[c]=pow[fu[c]];
			lazy[c]=false;
			if(start!=end)
			{
				lazy[2*c+1]=true;
				lazy[2*c+2]=true;
				fu[2*c+1]=fu[c];
				fu[2*c+2]=fu[c];
			}
		}
		if(start>end || start>r || end<l)
		{
			return;
		}
		if(start>=l && end<=r)
		{
			
			fu[c]=col;
			//boolean[] temp=new boolean[61];
			//temp[col]=true;
			segment[c]=pow[col];
			
			if(start!=end)
			{
				lazy[2*c+1]=true;
				lazy[2*c+2]=true;
				fu[2*c+1]=fu[c];
				fu[2*c+2]=fu[c];
			}
			return;
		}
		int mid=(start+end)/2;
		update(2*c+1,start,mid,l,r,col);
		update(2*c+2,mid+1,end,l,r,col);
		segment[c]=segment[2*c+1]|segment[2*c+2];
		
	}
	
	
	
	
	
	
	
	
	 static class InputReader {

		private InputStream stream;
		private byte[] buf = new byte[8192];
		private int curChar;
		private int snumChars;
		private SpaceCharFilter filter;

		public InputReader(InputStream stream) {
			this.stream = stream;
		}

		public int snext() {
			if (snumChars == -1)
				throw new InputMismatchException();
			if (curChar >= snumChars) {
				curChar = 0;
				try {
					snumChars = stream.read(buf);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (snumChars <= 0)
					return -1;
			}
			return buf[curChar++];
		}

		public int nextInt() {
			int c = snext();
			while (isSpaceChar(c))
				c = snext();
			int sgn = 1;
			if (c == '-') {
				sgn = -1;
				c = snext();
			}

			int res = 0;

			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res *= 10;
				res += c - '0';
				c = snext();
			} while (!isSpaceChar(c));

			return res * sgn;
		}
		
		public long nextLong() {
			int c = snext();
			while (isSpaceChar(c))
				c = snext();
			int sgn = 1;
			if (c == '-') {
				sgn = -1;
				c = snext();
			}

			long res = 0;

			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res *= 10;
				res += c - '0';
				c = snext();
			} while (!isSpaceChar(c));

			return res * sgn;
		}
		
		public String readString() {
			int c = snext();
			while (isSpaceChar(c))
				c = snext();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = snext();
			} while (!isSpaceChar(c));
			return res.toString();
		}

		public boolean isSpaceChar(int c) {
			if (filter != null)
				return filter.isSpaceChar(c);
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}

		public interface SpaceCharFilter {
			public boolean isSpaceChar(int ch);
		}
	}

}