#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-5;
const int MAX = 5e5 + 10;
const int MAXN = 4e5 + 10;
const int MOD = 20071027;
int n, k, r, u, v, q, vis[MAX], dis[MAX], fa[MAX], x, y;
int f[MAX][30], dep[MAX];
vector<int> G[MAX], V;
queue<int> Q;
int Find(int x) {
  if (fa[x] == x) return x;
  return fa[x] = Find(fa[x]);
}
void Union(int x, int y) {
  int fx = Find(x), fy = Find(y);
  if (fx == fy) return;
  fa[fx] = fy;
}
void dfs(int u, int ff) {
  f[u][0] = ff, dep[u] = dep[ff] + 1;
  for (auto v : G[u]) {
    if (v == ff) continue;
    dfs(v, u);
  }
}
void init() {
  for (int i = 1; i <= 20; i++) {
    for (int j = 1; j <= n; j++) {
      if (dep[f[j][i - 1]] <= 0) continue;
      if (dep[f[j][i - 1]] - (1 << (i - 1)) <= 0) continue;
      f[j][i] = f[f[j][i - 1]][i - 1];
    }
  }
}
int Lca(int x, int y) {
  if (x == y) return x;
  if (dep[x] < dep[y]) swap(x, y);
  for (int i = 20; i >= 0; i--) {
    if (dep[f[x][i]] >= dep[y]) x = f[x][i];
    if (x == y) return x;
  }
  for (int i = 20; i >= 0; i--) {
    if (f[x][i] != f[y][i]) {
      x = f[x][i];
      y = f[y][i];
    }
  }
  return f[x][0];
}
int walk_k(int u, int v, int k) {
  int rt = Lca(u, v);
  if (dep[u] < dep[v]) {
    swap(u, v);
    int d = dep[u] + dep[v] - 2 * dep[rt];
    return walk_k(u, v, d - k);
  }
  if (dep[u] - dep[rt] == k) {
    return rt;
  } else if (dep[u] - dep[rt] < k) {
    return walk_k(v, rt, k - (dep[u] - dep[rt]));
  } else {
    int pt = u;
    for (int i = 20; i >= 0; i--) {
      if (!k) break;
      if ((1 << i) <= k) {
        k -= (1 << i);
        pt = f[pt][i];
      }
    }
    return pt;
  }
}
int cal(int u, int d) {
  int d1 = d, u1 = u;
  for (int i = 0; i <= 20; ++i) {
    if ((d >> i) & 1) {
      u = f[u][i];
    }
  }
  return u;
}
int walk(int u, int v, int lca, int d) {
  if (d <= dep[u] - dep[lca]) return cal(u, d);
  d -= dep[u] - dep[lca];
  return cal(v, dep[v] - dep[lca] - d);
}
int main() {
  scanf("%d%d%d", &n, &k, &r);
  for (int i = 1; i < n; i++) {
    scanf("%d%d", &u, &v);
    G[u].push_back(n + i);
    G[n + i].push_back(u);
    G[v].push_back(n + i);
    G[n + i].push_back(v);
  }
  n *= 2;
  for (int i = 1; i <= n; i++) fa[i] = i;
  for (int i = 1; i <= r; i++) {
    scanf("%d", &x);
    Q.push(x);
    dis[x] = 0, vis[x] = 1;
  }
  while (Q.size()) {
    int u = Q.front();
    Q.pop();
    if (dis[u] >= k) break;
    for (auto v : G[u]) {
      Union(v, u);
      if (vis[v]) continue;
      vis[v] = 1;
      dis[v] = dis[u] + 1;
      Q.push(v);
    }
  }
  dfs(1, 0);
  init();
  scanf("%d", &q);
  while (q--) {
    scanf("%d%d", &u, &v);
    int rt = Lca(u, v);
    if (dep[u] + dep[v] - 2 * dep[rt] <= 2 * k || Find(u) == Find(v)) {
      printf("YES\n");
      continue;
    }
    int pt = walk(u, v, rt, k);
    int pz = walk(v, u, rt, k);
    if (Find(pt) == Find(pz)) {
      printf("YES\n");
    } else {
      printf("NO\n");
    }
  }
  return 0;
}
