CF1307F.Cow and Vacation

Bessie is planning a vacation! In Cow-lifornia, there are $n$ cities, with $n-1$ bidirectional roads connecting them. It is guaranteed that one can reach any city from any other city.

Bessie is considering $v$ possible vacation plans, with the $i$-th one consisting of a start city $a_i$ and destination city $b_i$.

It is known that only $r$ of the cities have rest stops. Bessie gets tired easily, and cannot travel across more than $k$ consecutive roads without resting. In fact, she is so desperate to rest that she may travel through the same city multiple times in order to do so.

For each of the vacation plans, does there exist a way for Bessie to travel from the starting city to the destination city?

贝茜正在计划一次假期！在牛加利福尼亚州（Cow-lifornia），共有 $n$ 座城市，由 $n-1$ 条双向道路连接。保证任意两座城市之间均可互相到达。

贝茜正在考虑 $v$ 种可能的度假方案，其中第 $i$ 种方案指定起点城市为 $a_i$、终点城市为 $b_i$。

已知仅有 $r$ 座城市设有休息站。贝茜很容易疲劳，若不休息，则她无法连续经过超过 $k$ 条道路。事实上，她对休息如此渴望，以至于可能会多次经过同一座城市以确保能及时休息。

对于每一种度假方案，是否存在一条从起点城市到终点城市的可行路径？

The first line contains three integers $n$, $k$, and $r$ ($2 \le n \le 2 \cdot 10^5$, $1 \le k,r \le n$) — the number of cities, the maximum number of roads Bessie is willing to travel through in a row without resting, and the number of rest stops.

Each of the following $n-1$ lines contain two integers $x_i$ and $y_i$ ($1 \le x_i, y_i \le n$, $x_i \neq y_i$), meaning city $x_i$ and city $y_i$ are connected by a road.

The next line contains $r$ integers separated by spaces — the cities with rest stops. Each city will appear at most once.

The next line contains $v$ ($1 \le v \le 2 \cdot 10^5$) — the number of vacation plans.

Each of the following $v$ lines contain two integers $a_i$ and $b_i$ ($1 \le a_i, b_i \le n$, $a_i \ne b_i$) — the start and end city of the vacation plan.

第一行包含三个整数 $n$、$k$ 和 $r$（$2 \le n \le 2 \cdot 10^5$，$1 \le k,r \le n$）——分别表示城市的数量、Bessie 愿意连续经过的道路的最大条数（途中不休息），以及休息站的数量。

接下来的 $n-1$ 行，每行包含两个整数 $x_i$ 和 $y_i$（$1 \le x_i, y_i \le n$，$x_i \neq y_i$），表示城市 $x_i$ 与城市 $y_i$ 之间有一条道路相连。

下一行包含 $r$ 个由空格分隔的整数——这些是设有休息站的城市编号。每个城市至多出现一次。

再下一行包含一个整数 $v$（$1 \le v \le 2 \cdot 10^5$）——表示度假计划的数量。

接下来的 $v$ 行，每行包含两个整数 $a_i$ 和 $b_i$（$1 \le a_i, b_i \le n$，$a_i \ne b_i$）——分别表示第 $i$ 个度假计划的起点城市和终点城市。

If Bessie can reach her destination without traveling across more than $k$ roads without resting for the $i$-th vacation plan, print YES. Otherwise, print NO.

如果贝茜能够到达目的地，且在第 $i$ 个度假计划中，不休息地连续经过的道路数不超过 $k$ 条，则输出 YES；否则输出 NO。

The graph for the first example is shown below. The rest stop is denoted by red.

For the first query, Bessie can visit these cities in order: $1, 2, 3$.

For the second query, Bessie can visit these cities in order: $3, 2, 4, 5$.

For the third query, Bessie cannot travel to her destination. For example, if she attempts to travel this way: $3, 2, 4, 5, 6$, she travels on more than $2$ roads without resting.

The graph for the second example is shown below.

第一个样例的图示如下所示，休息站用红色标出。

对于第一个查询，贝茜可以按以下顺序访问这些城市：$1, 2, 3$。

对于第二个查询，贝茜可以按以下顺序访问这些城市：$3, 2, 4, 5$。

对于第三个查询，贝茜无法到达目的地。例如，若她尝试按 $3, 2, 4, 5, 6$ 的路径行进，则会在未休息的情况下经过超过 $2$ 条道路。

第二个样例的图示如下所示。