#include <bits/stdc++.h>
using namespace std;
template <typename T>
void maxtt(T& t1, T t2) {
  t1 = max(t1, t2);
}
template <typename T>
void mintt(T& t1, T t2) {
  t1 = min(t1, t2);
}
bool debug = 0;
int n, m, k;
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
string direc = "URDL";
const long long MOD2 = (long long)1000000007 * (long long)1000000007;
long long ln, lk, lm;
void etp(bool f = 0) {
  puts(f ? "YES" : "NO");
  exit(0);
}
void addmod(int& x, int y, int mod = 1000000007) {
  x += y;
  if (x >= mod) x -= mod;
  if (x < 0) x += mod;
  assert(x >= 0 && x < mod);
}
void et(int x = -1) {
  printf("%d\n", x);
  exit(0);
}
long long fastPow(long long x, long long y, int mod = 1000000007) {
  long long ans = 1;
  while (y > 0) {
    if (y & 1) ans = (x * ans) % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return ans;
}
long long gcd1(long long x, long long y) { return y ? gcd1(y, x % y) : x; }
vector<int> mp[400135];
int r, d[400135], p[400135][20], stp[400135];
void adde(int x, int y) {
  mp[x].push_back(y);
  mp[y].push_back(x);
}
void dfs(int x, int pa) {
  d[x] = d[pa] + 1;
  p[x][0] = pa;
  for (int c : mp[x])
    if (c != pa) dfs(c, x);
}
void init() {
  for (int j = 1; (1 << j) <= n; j++)
    for (int i = 1; i <= n; i++) p[i][j] = p[p[i][j - 1]][j - 1];
}
int lca(int a, int b) {
  if (d[a] > d[b]) swap(a, b);
  int f = d[b] - d[a];
  for (int i = 0; (1 << i) <= f; i++)
    if ((1 << i) & f) b = p[b][i];
  if (a != b) {
    for (int i = 19; i >= 0; i--)
      if (p[a][i] != p[b][i]) {
        a = p[a][i];
        b = p[b][i];
      }
    a = p[a][0];
  }
  return a;
}
int f[400135];
int ff(int x) { return x == f[x] ? x : f[x] = ff(f[x]); }
void lik(int x, int y) {
  int fx = ff(x), fy = ff(y);
  if (fx == fy) return;
  f[fx] = fy;
}
void bfs() {
  queue<int> q;
  vector<int> dis(n + 2, (1000000000));
  for (int(i) = 1; (i) <= (int)(n); (i)++) f[i] = i;
  for (int(i) = 1; (i) <= (int)(r); (i)++) {
    q.push(stp[i]);
    dis[stp[i]] = 0;
  }
  while (!q.empty()) {
    int x = q.front();
    q.pop();
    if (dis[x] >= k) continue;
    for (int c : mp[x]) {
      lik(c, x);
      if (dis[c] > dis[x] + 1) {
        dis[c] = dis[x] + 1;
        q.push(c);
      }
    }
  }
}
int fd(int x, int D) {
  for (int i = 18; i >= 0; i--)
    if (D & (1 << i)) x = p[x][i];
  return x;
}
void fmain(int tid) {
  scanf("%d%d%d", &n, &k, &r);
  int cnt = n;
  for (int(i) = 1; (i) <= (int)(n - 1); (i)++) {
    int u, v;
    scanf("%d%d", &u, &v);
    cnt++;
    adde(u, cnt);
    adde(cnt, v);
  }
  n = cnt;
  for (int(i) = 1; (i) <= (int)(r); (i)++) scanf("%d", stp + i);
  dfs(1, 0);
  bfs();
  init();
  scanf("%d", &m);
  for (int(i) = 1; (i) <= (int)(m); (i)++) {
    int a, b;
    scanf("%d%d", &a, &b);
    int c = lca(a, b);
    int dis = d[a] + d[b] - d[c] * 2;
    if (dis <= k + k)
      puts("YES");
    else {
      int fa, fb;
      if (d[a] - d[c] >= k)
        fa = fd(a, k);
      else
        fa = fd(b, d[b] - d[c] - (k - (d[a] - d[c])));
      if (d[b] - d[c] >= k)
        fb = fd(b, k);
      else
        fb = fd(a, d[a] - d[c] - (k - (d[b] - d[c])));
      puts(ff(fa) == ff(fb) ? "YES" : "NO");
    }
  }
}
int main() {
  int t = 1;
  for (int(i) = 1; (i) <= (int)(t); (i)++) {
    fmain(i);
  }
  return 0;
}
