375_D. Tree and Queries_9668
You have a rooted tree consisting of n vertices. Each vertex of the tree has some color. We will assume that the tree vertices are numbered by integers from 1 to n. Then we represent the color of vertex v as cv. The tree root is a vertex with number 1.

In this problem you need to answer to m queries. Each query is described by two integers vj, kj. The answer to query vj, kj is the number of such colors of vertices x, that the subtree of vertex vj contains at least kj vertices of color x.

You can find the definition of a rooted tree by the following link: http://en.wikipedia.org/wiki/Tree_(graph_theory).

Input

The first line contains two integers n and m (2 ≤ n ≤ 105; 1 ≤ m ≤ 105). The next line contains a sequence of integers c1, c2, ..., cn (1 ≤ ci ≤ 105). The next n - 1 lines contain the edges of the tree. The i-th line contains the numbers ai, bi (1 ≤ ai, bi ≤ n; ai ≠ bi) — the vertices connected by an edge of the tree.

Next m lines contain the queries. The j-th line contains two integers vj, kj (1 ≤ vj ≤ n; 1 ≤ kj ≤ 105).

Output

Print m integers — the answers to the queries in the order the queries appear in the input.

Examples

Input

8 5
1 2 2 3 3 2 3 3
1 2
1 5
2 3
2 4
5 6
5 7
5 8
1 2
1 3
1 4
2 3
5 3


Output

2
2
1
0
1


Input

4 1
1 2 3 4
1 2
2 3
3 4
1 1


Output

4

Note

A subtree of vertex v in a rooted tree with root r is a set of vertices {u : dist(r, v) + dist(v, u) = dist(r, u)}. Where dist(x, y) is the length (in edges) of the shortest path between vertices x and y.

import java.io.BufferedReader;
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.Comparator;
import java.util.StringTokenizer;

public class TreeAndQueries {

	static class Query {
		int L, R, k, idx;

		Query(int l, int r, int k, int i) {
			L = l;
			R = r;
			this.k = k;
			idx = i;
		}
	}

	static final int MAX = (int) 1e5 + 1;
	static ArrayList<Integer>[] graph;
	static int[] color, tin, tout, euler, ans, count;
	static int idx;

	static void dfs(int u, int p) {
		euler[idx] = color[u];
		tin[u] = idx++;
		for (int v : graph[u]) {
			if(p != v)
				dfs(v, u);
		}
		tout[u] = idx - 1;
	}

	static void add(int val) {
		ans[++count[val]]++;
	}

	static void remove(int val) {
		ans[count[val]--]--;
	}

	public static void main(String[] args) throws IOException {
		MyScanner sc = new MyScanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		int n = sc.nextInt(), m = sc.nextInt();
		color = new int[n];
		for (int i = 0; i < n; i++)
			color[i] = sc.nextInt();
		graph = new ArrayList[n];
		for (int i = 0; i < n; i++)
			graph[i] = new ArrayList<>();
		for (int i = 1; i < n; i++) {
			int u = sc.nextInt() - 1, v = sc.nextInt() - 1;
			graph[u].add(v);
			graph[v].add(u);
		}
		idx = 0;
		euler = new int[n];
		tin = new int[n];
		tout = new int[n];
		dfs(0, -1);
		final int BLOCK_SIZE = (int) Math.sqrt(n);
		Query[] queries = new Query[m];
		for (int i = 0; i < m; i++) {
			int u = sc.nextInt();
			queries[i] = new Query(tin[u - 1], tout[u - 1], sc.nextInt(), i);
		}
		Arrays.sort(queries, new Comparator<Query>() {
			@Override
			public int compare(Query q1, Query q2) {
				int x = q1.L / BLOCK_SIZE, y = q2.L / BLOCK_SIZE;
				if (x != y)
					return x - y;
				else
					return q1.R - q2.R;
			}
		});
		count = new int[MAX];
		ans = new int[MAX];
		int[] answer = new int[m];
		int MOL = 0, MOR = -1;
		for (int i = 0; i < m; i++) {
			Query q = queries[i];
			int L = q.L, R = q.R, k = q.k;
			while (MOR < R) {
				MOR++;
				add(euler[MOR]);
			}
			while (MOR > R) {
				remove(euler[MOR]);
				MOR--;
			}
			while (MOL < L) {
				remove(euler[MOL]);
				MOL++;
			}
			while (MOL > L) {
				MOL--;
				add(euler[MOL]);
			}
			answer[q.idx] = ans[q.k];
		}
		for(int x : answer)
			out.println(x);
		out.close();
	}

	static class MyScanner {
		BufferedReader br;
		StringTokenizer st;

		public MyScanner(InputStream is) {
			br = new BufferedReader(new InputStreamReader(is));
		}

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

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

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

8 5
1 2 2 3 3 2 3 3
1 2
1 5
2 3
2 4
5 6
5 7
5 8
1 2
1 3
1 4
2 3
5 3
 4 1
1 2 3 4
1 2
2 3
3 4
1 1
 4 1
1 4 3 4
1 2
2 3
3 4
1 1
 4 1
1 4 6 7
1 2
2 3
3 4
1 1
 8 5
1 2 2 3 3 2 3 3
1 2
1 5
2 3
2 4
5 6
5 7
5 8
1 3
1 3
1 4
2 3
5 3
 8 5
1 2 2 3 3 3 3 3
1 2
1 5
2 3
2 4
5 6
5 7
5 8
1 2
1 3
1 4
2 3
5 3
 4 1
1 4 3 4
1 2
2 3
3 4
1 2
 4 1
1 2 3 4
1 2
2 3
3 4
1 2
 8 5
1 2 2 3 3 3 3 3
1 2
1 5
2 3
2 4
5 6
5 7
5 8
1 2
1 3
1 4
2 3
7 3
 4 1
1 4 6 4
1 2
2 3
3 4
1 1
 4 1
1 7 6 7
1 2
2 3
3 4
1 1
 4 1
1 5 3 4
1 2
2 3
3 4
1 1
 4 1
1 2 6 4
1 2
2 3
3 4
1 1
 4 1
1 3 6 4
1 2
2 3
3 4
1 1
 4 1
1 2 3 7
1 2
2 3
3 4
1 1
 4 1
1 11 6 7
1 2
2 3
3 4
1 1
 4 1
1 5 3 4
1 4
2 3
3 4
1 1
 8 5
1 2 2 3 3 3 3 3
1 2
1 5
2 3
2 4
5 6
5 7
5 8
1 2
1 3
1 4
2 3
5 1
 4 1
1 11 12 7
1 2
2 3
3 4
1 1
 4 1
1 5 3 1
1 4
2 3
3 4
1 1
 8 5
1 2 2 3 3 2 3 3
1 2
1 5
2 3
3 4
5 6
5 7
5 8
1 2
1 3
1 4
2 3
5 3
 4 1
1 4 3 7
1 2
2 3
3 4
1 1
 8 5
1 2 2 3 3 2 3 3
1 2
1 5
2 3
2 4
5 6
5 7
5 8
1 3
1 3
1 4
4 3
5 3
 8 5
1 2 2 3 3 5 3 3
1 2
1 5
2 3
2 4
5 6
5 7
5 8
1 2
1 3
1 4
2 3
5 3
 4 1
1 2 3 7
1 4
2 3
3 4
1 1
 4 1
1 2 3 4
1 2
2 4
3 4
1 2
 4 1
1 11 12 1
1 2
2 3
3 4
1 1
 4 1
1 5 3 1
1 4
2 3
3 4
2 1
 4 1
2 4 3 7
1 2
2 3
3 4
1 1
 8 5
1 2 2 3 3 2 3 3
1 2
2 5
2 3
2 4
5 6
5 7
5 8
1 3
1 3
1 4
4 3
5 3
 4 1
1 2 3 4
1 2
2 4
3 4
1 1
 4 1
1 1 3 1
1 4
2 3
3 4
2 1
 4 1
2 4 3 7
1 2
1 3
3 4
1 1
 4 1
1 4 3 4
1 2
2 4
3 4
1 1
 4 1
2 4 1 7
1 2
1 3
3 4
1 1
 4 1
1 7 3 4
1 2
2 3
3 4
1 1
 4 1
1 4 6 7
1 2
2 3
3 4
1 2
 4 1
1 7 6 7
1 3
2 3
3 4
1 1
 4 1
1 5 3 8
1 4
2 3
3 4
1 1

2
2
1
0
1
 4
 3
 4
 2
2
1
0
1
 2
1
1
0
1
 1
 0
 2
1
1
0
0
 3
 3
 4
 4
 4
 4
 4
 4
 2
1
1
0
1
 4
 3
 2
2
1
0
1
 4
 2
2
1
0
1
 2
1
1
0
1
 4
 0
 3
 1
 4
 2
2
1
0
1
 4
 1
 4
 3
 4
 4
 0
 3
 4
