#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 dfs1(int u, int fa)
{
    int cnt = 0;
    for (auto to : e[u])
        if (to != fa)
        {
            cnt++;
            dfs1(to, u);
            if (!vis[to])
                mx[u] = max(mx[to], mx[u]);
        }
    mx[u] = max(mx[u], cnt);
}
void dfs(int u, int fa, int ok)
{
    if (ok == 2)
    {
        return;
    }
    ans++;
    if (vis[u])
    {
        if (mx[u] >= 2)
        {
            for (auto to : e[u])
                if (to != fa)
                    dfs(to, u, ok);
        }
        else
        {
            for (auto to : e[u])
                if (to != fa)
                {
                    ans--;
                    dfs(to, u, ok + 1);
                }
        }
    }
    else
    {
        for (auto to : e[u])
            if (to != fa)
                dfs(to, u, ok);
    }
}

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;
    }
    dfs1(1, 0);
    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;
}