Problem: 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?

Input

The first line contains three integers n, k, and r (2 ≤ n ≤ 2 ⋅ 10^5, 1 ≤ k,r ≤ 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 ≤ x_i, y_i ≤ n, x_i ≠ 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 ≤ v ≤ 2 ⋅ 10^5) — the number of vacation plans.

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

Output

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.

Examples

Input


6 2 1
1 2
2 3
2 4
4 5
5 6
2
3
1 3
3 5
3 6


Output


YES
YES
NO


Input


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


Output


YES
NO

Note

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.

<image>

The graph for the second example is shown below. 

<image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
void read(int &a) {
  a = 0;
  char c = getchar();
  while (c < '0' || c > '9') {
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    a = (a << 1) + (a << 3) + (c ^ 48);
    c = getchar();
  }
}
const int Maxn = 400000;
const int Inf = 0x3f3f3f3f;
int head[Maxn + 5], arrive[Maxn << 1 | 5], nxt[Maxn << 1 | 5], tot;
void add_edge(int from, int to) {
  arrive[++tot] = to;
  nxt[tot] = head[from];
  head[from] = tot;
}
int n, k, r;
int s[Maxn + 5];
int dis[Maxn + 5];
int f[Maxn + 5];
int find(int x) {
  if (x == f[x]) {
    return x;
  }
  return f[x] = find(f[x]);
}
void merge(int x, int y) {
  int fa_x = find(x), fa_y = find(y);
  if (fa_x == fa_y) {
    return;
  }
  f[fa_y] = fa_x;
}
int fa[20][Maxn + 5];
int dep[Maxn + 5];
void init_dfs(int u) {
  dep[u] = dep[fa[0][u]] + 1;
  for (int i = 1; fa[i - 1][fa[i - 1][u]]; i++) {
    fa[i][u] = fa[i - 1][fa[i - 1][u]];
  }
  for (int i = head[u]; i; i = nxt[i]) {
    int v = arrive[i];
    if (v == fa[0][u]) {
      continue;
    }
    fa[0][v] = u;
    init_dfs(v);
  }
}
void swp(int &a, int &b) {
  int t = a;
  a = b;
  b = t;
}
int find_lca(int u, int v) {
  if (dep[u] < dep[v]) {
    swp(u, v);
  }
  for (int i = 19; i >= 0; i--) {
    if (dep[fa[i][u]] >= dep[v]) {
      u = fa[i][u];
    }
  }
  if (u == v) {
    return u;
  }
  for (int i = 19; i >= 0; i--) {
    if (fa[i][u] != fa[i][v]) {
      u = fa[i][u];
      v = fa[i][v];
    }
  }
  return fa[0][u];
}
int find_kth(int u, int k) {
  for (int i = 19; i >= 0; i--) {
    if ((k >> i) & 1) {
      u = fa[i][u];
    }
  }
  return u;
}
queue<int> q;
void init_bfs() {
  memset(dis, 0x3f, sizeof dis);
  for (int i = 1; i < (n << 1); i++) {
    f[i] = i;
  }
  for (int i = 1; i <= r; i++) {
    q.push(s[i]);
    dis[s[i]] = 0;
  }
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    if (dis[u] == k) {
      break;
    }
    for (int i = head[u]; i; i = nxt[i]) {
      int v = arrive[i];
      merge(v, u);
      if (dis[v] == Inf) {
        dis[v] = dis[u] + 1;
        q.push(v);
      }
    }
  }
}
int walk(int u, int v, int lca) {
  if (dep[u] - dep[lca] >= k) {
    return find_kth(u, k);
  }
  return find_kth(v, dep[u] + dep[v] - (dep[lca] << 1) - k);
}
bool check(int u, int v) {
  int lca = find_lca(u, v);
  if (dep[u] + dep[v] - (dep[lca] << 1) <= (k << 1)) {
    return 1;
  }
  return find(walk(u, v, lca)) == find(walk(v, u, lca));
}
int main() {
  read(n), read(k), read(r);
  int u, v;
  for (int i = 1; i < n; i++) {
    read(u), read(v);
    add_edge(u, i + n);
    add_edge(i + n, u);
    add_edge(v, i + n);
    add_edge(i + n, v);
  }
  init_dfs(1);
  for (int i = 1; i <= r; i++) {
    read(s[i]);
  }
  init_bfs();
  int q;
  read(q);
  for (int i = 1; i <= q; i++) {
    read(u), read(v);
    if (check(u, v)) {
      puts("YES");
    } else {
      puts("NO");
    }
  }
  return 0;
}