#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, const U &b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, const U &b) {
  if (a < b) a = b;
}
template <typename T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T, class T1>
inline void gn(T &first, T1 &second) {
  gn(first);
  gn(second);
}
template <class T, class T1, class T2>
inline void gn(T &first, T1 &second, T2 &z) {
  gn(first);
  gn(second);
  gn(z);
}
template <typename T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <typename T>
inline void println(T first) {
  print(first), putchar('\n');
}
template <typename T>
inline void printsp(T first) {
  print(first), putchar(' ');
}
template <class T, class T1>
inline void print(T first, T1 second) {
  printsp(first), println(second);
}
template <class T, class T1, class T2>
inline void print(T first, T1 second, T2 z) {
  printsp(first), printsp(second), println(z);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = (long long)a * a % m)
    if (b & 1) ans = (long long)ans * a % m;
  return ans;
}
vector<int> adj[111111];
int mx[111111], vst[111111], mmx[111111];
void dfs(int u, int fa = 0) {
  mx[u] = mmx[u] = -0x3f3f3f3f;
  if (vst[u]) mx[u] = 0;
  for (int i = 0; i < adj[u].size(); i++) {
    int v = adj[u][i];
    if (v == fa) continue;
    dfs(v, u);
    if (mx[v] + 1 > mmx[u]) {
      mmx[u] = mx[v] + 1;
      if (mmx[u] > mx[u]) swap(mmx[u], mx[u]);
    }
  }
}
void rdfs(int u, int fa = 0) {
  for (int i = 0; i < adj[u].size(); i++) {
    int v = adj[u][i];
    if (v == fa) continue;
    if (mx[u] < 0x3f3f3f3f) {
      if (mx[u] == mx[v] + 1) {
        if (mmx[v] < mmx[u] + 1) {
          mmx[v] = mmx[u] + 1;
          if (mmx[v] > mx[v]) swap(mx[v], mmx[v]);
        }
      } else if (mmx[v] < mx[u] + 1) {
        mmx[v] = mx[u] + 1;
        if (mmx[v] > mx[v]) swap(mx[v], mmx[v]);
      }
    }
    rdfs(v, u);
  }
}
int main() {
  int n, m, D, first;
  gn(n, m, D);
  while (m--) gn(first), vst[first] = 1;
  for (int i = 1; i < n; i++) {
    int u, v;
    gn(u, v);
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  dfs(1);
  rdfs(1);
  int ans = 0;
  for (int i = 1; i <= n; i++)
    if (mx[i] <= D) ans++;
  println(ans);
}
