#include <bits/stdc++.h>

using namespace std;
#define int long long
#define endl '\n'
#define PII pair<int, int>
const int N = 2e5 + 5;
int n, m, ans, vis[N], mx[N];
vector<int> e[N];
void dfs(int u, int fa, int ok)
{
    if (ok && vis[u])
    {
        return;
    }
    ans++;
    if (vis[u])
    {
        int cnt = 0;
        for (auto to : e[u])
            if (to != fa && !vis[to])
                cnt++;
        int mx = 0;
        if (cnt >= 2)
            mx = 1;
        for (auto to : e[u])
            if (to != fa)
            {
                dfs(to, u, ok + 1 - mx);
            }
    }
    else
    {

        int cnt = 0;
        for (auto to : e[u])
            if (to != fa && !vis[to])
                cnt++;
        int mx = 0;
        if (cnt >= 2)
            mx = 1;
        for (auto to : e[u])
            if (to != fa)
                dfs(to, u, max(0ll, ok - mx));
    }
    if (u != 1 && e[u].size() == 1 && ok)
        ans--;
}

void solve()
{
    cin >> n >> m;
    for (int i = 1; i < n; i++)
    {
        int u, v;
        cin >> u >> v;
        e[u].push_back(v);
        e[v].push_back(u);
    }
    for (int i = 1; i <= m; i++)
    {
        int x;
        cin >> x;
        vis[x] = 1;
    }
    dfs(1, 0, 0);
    cout << ans << endl;
}

signed main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t = 1;
    while (t--)
        solve();
    return 0;
}