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:
/* package whatever; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;
import static java.lang.Math.max;
import static java.lang.Math.min;
import static java.lang.Math.abs;
import java.util.Arrays;

/* Name of the class has to be "Main" only if the class is public. */
public class ValentineProject {

    ArrayList<Integer>[] edge = new ArrayList[400005];
    long seg[] = new long[4 * 400001];
    int l[] = new int[400005];
    int r[] = new int[400005];
    int t = 0;
    int c[] = new int[400005];
    int a[] = new int[400005];
    long layer[] = new long[4*400001];

    private void solve() throws IOException {
        int u,v,color, ty, ans;
        long mask;

        for(int i=1;i<=400000;++i){
          edge[i] = new ArrayList<>();
        }

        Arrays.fill(seg, 0);
        Arrays.fill(layer, -1);

        int n = nextInt();
        int m = nextInt();
        for(int i=1;i<=n;++i){
            c[i] = nextInt();
            c[i]--;
        }
        for(int i=1;i<n;++i){
            u = nextInt(); v = nextInt();
            edge[u].add(v);
            edge[v].add(u);
        }
        dfs(1,0);
        build(1,1,n);

        while( m > 0){
            m --;
            ty = nextInt();
            if( ty == 1){
                v = nextInt(); color = nextInt();
                update(1,1,n,l[v],r[v],color-1);
            }
            else{
                v = nextInt();
                mask = query(1,1,n,l[v], r[v]);
                ans = 0;
                while( mask > 0){
                    ans++;
                    mask -= mask&(-mask);
                }
                writer.println(ans);
            }
        }

    }

    public void dfs(int vertex, int parent)
    {
        l[vertex] = ++t;
        a[t] = vertex;
        Iterator<Integer> itr = edge[vertex].iterator();
        int vr;
        while( itr.hasNext() ){
            vr = itr.next();
            if( vr != parent){
                dfs( vr, vertex);
            }
        }
        r[vertex] = t;
    }

    public void build(int n,int it,int f)
    {
        if(it == f){
            seg[n] = 1L<<c[a[f]];
            layer[n] = seg[n];
            return;
        }
        int m = (it + f)/2;
        build(n*2,it,m);
        build(n*2+1,m+1,f);
        seg[n] = seg[n*2] | seg[n*2+1];
    }

    public void update(int n,int it,int f,int q1,int q2,int color)
    {
        if( it==q1 && f==q2){
            seg[n] = 1L << color;
            layer[n] = seg[n];
            return ;
        }

        int m = (it + f)/2, ln = n * 2, rn;
        rn = ln + 1;
        if(layer[n] != -1){
            seg[ln] = seg[rn] = layer[ln] = layer[rn] = layer[n];
            layer[n] = -1;
        }
        if( q2 <=m ){
            update(ln,it,m,q1,q2,color);
        }
        else if(q1>m)
            update(rn,m+1,f,q1,q2,color);
        else{
            update(ln,it,m,q1,m,color);
            update(rn,m+1,f,m+1,q2,color);
        }
        seg[n] = seg[ln] | seg[rn];
    }

    public long query(int n,int it,int f,int q1,int q2)
    {
        if(layer[n] != -1)
            return layer[n];
        if(q1==it && f==q2)
            return seg[n];
        int m = (it+f)/2;
        if( q2 <= m)
            return query(n*2,it,m,q1,q2);
        else if ( q1 > m)
            return query(n*2+1,m+1,f,q1,q2);
        return ( query(n*2,it,m,q1,m) | query(n*2+1,m+1,f,m+1,q2));
    }

    public static void main(String[] args) {
        // TODO code application logic here
        new ValentineProject().run();
    }
    
    BufferedReader reader;
    StringTokenizer tokenizer;
    PrintWriter writer;
    
    public void run() {
        try {
            reader = new BufferedReader(new InputStreamReader(System.in));
            tokenizer = null;
            writer = new PrintWriter(System.out);
            solve();
            reader.close();
            writer.close();
        } catch (Exception e) {
            e.printStackTrace();
            System.exit(1);
        }
    }
    
    int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }

    long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }

    double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }

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