#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3f;
const int MOD = 1e9 + 7;
int dir[8][2] = {-1, 0, 1, 0, 0, -1, 0, 1, -1, -1, -1, 1, 1, -1, 1, 1};
template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> x) {
  os << "(" << x.first << ", " << x.second << ")";
  return os;
}
template <typename S, typename T>
inline bool Min(S &a, const T &b) {
  return a > b ? a = b, true : false;
}
template <typename S, typename T>
inline bool Max(S &a, const T &b) {
  return a < b ? a = b, true : false;
}
template <typename S, typename T>
inline void Adm(S &a, const T &b) {
  a = (a + b) % MOD;
  if (a < 0) a += MOD;
}
template <typename T>
inline bool IsPri(T x) {
  if (x < 2) return false;
  for (T i = 2; i * i <= x; ++i)
    if (x % i == 0) return false;
  return true;
}
template <typename T>
inline T _Gcd(T a, T b) {
  while (b) {
    T t = b;
    b = a % b;
    a = t;
  }
  return a;
}
template <typename T>
inline int _BitCnt(T x) {
  int cnt = 0;
  while (x) ++cnt, x &= x - 1;
  return cnt;
}
inline long long Pow(long long a, long long n) {
  long long t = 1;
  a %= MOD;
  while (n > 0) {
    if (n & 1) t = t * a % MOD;
    a = a * a % MOD, n >>= 1;
  }
  return t % MOD;
}
inline int read() {
  static char buf[1000000], *p1 = buf, *p2 = buf;
  register int x = false;
  register char ch =
      p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin), p1 == p2)
          ? EOF
          : *p1++;
  ;
  register bool sgn = false;
  while (ch != '-' && (ch < '0' || ch > '9'))
    ch = p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin), p1 == p2)
             ? EOF
             : *p1++;
  ;
  if (ch == '-')
    sgn = true,
    ch = p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin), p1 == p2)
             ? EOF
             : *p1++;
  ;
  while (ch >= '0' && ch <= '9')
    x = (x << 1) + (x << 3) + (ch ^ 48),
    ch = p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin), p1 == p2)
             ? EOF
             : *p1++;
  ;
  return sgn ? -x : x;
}
const int N = 4e5 + 100;
int a[N];
vector<int> e[N];
int rt[N], dis[N], fz[N][20], dep[N];
int Find(int x) {
  if (rt[x] != x) rt[x] = Find(rt[x]);
  return rt[x];
}
void Merge(int x, int y) { rt[Find(x)] = Find(y); }
void DFS(int x, int f) {
  fz[x][0] = f, dep[x] = dep[f] + 1;
  for (int i = 1; i < 20; ++i) fz[x][i] = fz[fz[x][i - 1]][i - 1];
  for (int y : e[x])
    if (y != f) DFS(y, x);
}
int LCA(int x, int y) {
  if (dep[x] < dep[y]) swap(x, y);
  for (int i = 19; dep[x] != dep[y]; --i)
    if (dep[fz[x][i]] >= dep[y]) x = fz[x][i];
  if (x == y) return x;
  for (int i = 19; i >= 0; --i)
    if (fz[x][i] != fz[y][i]) x = fz[x][i], y = fz[y][i];
  return fz[x][0];
}
int Up(int x, int k) {
  for (int i = 0; i < 20; ++i)
    if (k >> i & 1) x = fz[x][i];
  return x;
}
int Move(int x, int y, int k) {
  int a = LCA(x, y);
  if (dep[x] - dep[a] >= k) return Up(x, k);
  return Up(y, dep[x] + dep[y] - 2 * dep[a] - k);
}
int main() {
  for (int i = 0; i < N; ++i) rt[i] = i;
  int n, k, r;
  cin >> n >> k >> r;
  for (int i = 1; i < n; ++i) {
    int u, v;
    scanf("%d%d", &u, &v);
    e[u].push_back(n + i), e[n + i].push_back(u);
    e[v].push_back(n + i), e[n + i].push_back(v);
  }
  DFS(1, 0);
  queue<int> q;
  memset((dis), (0x3f), sizeof(dis));
  for (int i = 1; i <= r; ++i) scanf("%d", &a[i]), dis[a[i]] = 0, q.push(a[i]);
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    for (int v : e[u]) {
      if (dis[u] < k) Merge(u, v);
      if (dis[v] > dis[u] + 1) dis[v] = dis[u] + 1, q.push(v);
    }
  }
  int Q;
  cin >> Q;
  while (Q--) {
    int x, y, a;
    scanf("%d%d", &x, &y), a = LCA(x, y);
    if (dep[x] + dep[y] - 2 * dep[a] <= k * 2)
      puts("YES");
    else {
      x = Move(x, y, k), y = Move(y, x, k);
      puts(Find(x) == Find(y) ? "YES" : "NO");
    }
  }
  return 0;
}
