Background

Translated from Izborne Pripreme 2021 (Croatian IOI/CEOI Team Selection) D2T1。$\texttt{5s,1G}$。

Problem Description

You are given a rooted tree with $N$ nodes, rooted at $1$. Let the value (weight) of node $i$ be $a_i$.

Define one operation as follows:

• Initialize $u$ as the root of the tree.
  1. Let $v$ be the child of $u$ with the largest value (if there are multiple, choose one uniformly at random). Set $a_u\gets a_v$ and $a_v\gets 0$.
  2. If $v$ is a leaf, delete $v$ and terminate this process. Otherwise set $u\gets v$ and go back to step 1.

Define $f(v)$ as: in the worst case, in order to make $a_v$ appear at the root as fast as possible (i.e., using as few operations as possible), what is the minimum number of nodes whose values must be changed (you may also choose not to change any).

In other words, in the worst case, node $v$ needs $k$ operations to reach the root. Obviously, when the tree shape is fixed, different node values will make $k$ take different values, and $k$ has a lower bound. You need to modify the values of some nodes so that $k$ reaches this lower bound, while minimizing the number of modifications.

A node value can be changed to any integer in $[0,2\times 10^9]$.

There are $Q$ queries. Given $v$, output $f(v)$.

Input Format

The first line contains one positive integer $N$.

The second line contains $N$ positive integers $a_i$.

The next $(N-1)$ lines each contain two positive integers $u,v$, describing an edge $(u,v)$ in the tree.

The next line contains one positive integer $Q$.

The next $Q$ lines each contain one positive integer $v$, representing a query for $f(v)$.

Output Format

Output $Q$ lines, each being the answer to one query.

3
1 2 3
1 2
1 3
3
1
2
3

0
1
0

7
45 13 19 3 81 27 77
1 2
1 3
1 4
3 5
3 6
4 7
3
5
6
7

0
1
1

8
23 4 9 7 11 4 1 18
2 1
3 2
4 2
5 2
6 3
7 4
8 1
3
2
3
7

1
2
3

Hint

For $100\%$ of the testdata, it is guaranteed that $1\le Q\le N\le 1\times 10^5$, $1\le a_i\le 10^9$, $1\le v\le N$. The input is a tree.

Constraints

Special Property: $Q\le 1$。

Translated by ChatGPT 5