#include <bits/stdc++.h>
using namespace std;
const long long inf = 2147383647;
const double pi = 2 * acos(0.0);
const double eps = 1e-9;
struct debugger {
  template <typename T>
  debugger& operator,(const T& v) {
    cerr << v << " ";
    return *this;
  }
} dbg;
inline long long gcd(long long a, long long b) {
  a = ((a) < 0 ? -(a) : (a));
  b = ((b) < 0 ? -(b) : (b));
  while (b) {
    a = a % b;
    swap(a, b);
  }
  return a;
}
long long ext_gcd(long long A, long long B, long long* X, long long* Y) {
  long long x2, y2, x1, y1, x, y, r2, r1, q, r;
  x2 = 1;
  y2 = 0;
  x1 = 0;
  y1 = 1;
  for (r2 = A, r1 = B; r1 != 0;
       r2 = r1, r1 = r, x2 = x1, y2 = y1, x1 = x, y1 = y) {
    q = r2 / r1;
    r = r2 % r1;
    x = x2 - (q * x1);
    y = y2 - (q * y1);
  }
  *X = x2;
  *Y = y2;
  return r2;
}
inline long long modInv(long long a, long long m) {
  long long x, y;
  ext_gcd(a, m, &x, &y);
  if (x < 0) x += m;
  return x;
}
inline long long power(long long a, long long p) {
  long long res = 1, x = a;
  while (p) {
    if (p & 1) res = (res * x);
    x = (x * x);
    p >>= 1;
  }
  return res;
}
inline long long bigmod(long long a, long long p, long long m) {
  long long res = 1 % m, x = a % m;
  while (p) {
    if (p & 1) res = (res * x) % m;
    x = (x * x) % m;
    p >>= 1;
  }
  return res;
}
using namespace std;
template <typename T>
ostream& operator<<(ostream& out, vector<T> v) {
  out << "[ ";
  for (int i = 0; i < (((int)(v).size())); i++) {
    if (i) out << ", ";
    out << v[i];
  }
  out << " ]";
  return out;
}
template <typename T1, typename T2>
ostream& operator<<(ostream& out, pair<T1, T2> p) {
  out << "( " << p.first << ", " << p.second << ")";
  return out;
}
template <typename T>
ostream& operator,(ostream& out, T x) {
  out << x << " ";
  return out;
}
int N, M, D;
bool isSpecial[100007];
vector<int> graph[100007];
int distDown[100007][2], distUp[100007];
bool visited[100007];
int parent[100007];
int dfsDown(int u) {
  visited[u] = true;
  int v;
  distDown[u][0] = distDown[u][1] = -(1 << 29);
  if (isSpecial[u]) {
    distDown[u][0] = 0;
  }
  int tmp;
  for (int i = 0; i < (((int)(graph[u]).size())); i++) {
    v = graph[u][i];
    if (!visited[v]) {
      parent[v] = u;
      tmp = dfsDown(v);
      if (distDown[u][0] < tmp + 1) {
        distDown[u][1] = distDown[u][0];
        distDown[u][0] = tmp + 1;
      } else if (distDown[u][1] < tmp + 1) {
        distDown[u][1] = tmp + 1;
      }
    }
  }
  return distDown[u][0];
}
void dfsUp(int u) {
  int p = parent[u];
  distUp[u] = -(1 << 29);
  int& ret = distUp[u];
  if (p == -1) {
    goto hell;
  }
  if (distDown[p][0] == distDown[u][0] + 1) {
    ret = distDown[p][1] + 1;
  } else {
    ret = distDown[p][0] + 1;
  }
  ret = ((ret) > (distUp[p] + 1) ? (ret) : (distUp[p] + 1));
hell:
  visited[u] = true;
  for (int i = 0; i < (((int)(graph[u]).size())); i++) {
    p = graph[u][i];
    if (!visited[p]) {
      dfsUp(p);
    }
  }
}
void solve() {
  int r = 4;
  memset(parent, -1, sizeof(parent));
  dfsDown(r);
  memset(visited, 0, sizeof(visited));
  dfsUp(r);
  int cnt = 0;
  for (int i = 1; i <= N; i++) {
    if (((distUp[i]) > (distDown[i][0]) ? (distUp[i]) : (distDown[i][0])) <=
        D) {
      cnt++;
    }
  }
  printf("%d\n", cnt);
}
int main() {
  int p, q;
  scanf("%d %d %d", &N, &M, &D);
  for (int i = 0; i < (M); i++) {
    scanf("%d", &p);
    isSpecial[p] = true;
  }
  for (int i = 1; i < N; i++) {
    scanf("%d %d", &p, &q);
    graph[p].push_back(q);
    graph[q].push_back(p);
  }
  solve();
  return 0;
}
