#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
const int N = 200005;
const int INF = 0x3f3f3f3f;
ll a[N];
int b[N];
int f[N];
vector<int> G[N];
int du[N];
bool vis[N];
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int i = 1; i < n; i++) {
        int u, v;
        cin >> u >> v;
        G[u].push_back(v);
        G[v].push_back(u);
        du[u]++, du[v]++;
    }
    for (int i = 0; i < m; i++) cin >> b[i];
    memset(f, 0x3f, sizeof f);
    queue<int> q;
    for (int i = 0; i < n; i++) {
        f[b[i]] = 0;
        q.push(b[i]);
    }
    while (!q.empty()) {
        int u = q.front();
        q.pop();
        for (auto v : G[u]) {
            if (f[v] == INF) {
                f[v] = f[u] + 1;
                q.push(v);
            }
        }
    }
    priority_queue<pair<ll, int>> pq;
    for (int i = 1; i <= n; i++) {
        if (!vis[i] && du[i] == 1 && f[i] > 0) pq.push({a[i], i});
    }
    ll ans = 0;
    int ck = 1;
    while (1) {
        while (!pq.empty()) {
            auto [p, u] = pq.top();
            if (vis[u] || f[u] < ck) {
                pq.pop();
            } else {
                break;
            }
        }
        if (pq.empty()) break;
        auto [p, u] = pq.top();
        pq.pop();
        vis[u] = 1;
        ans += p;
        for (auto v : G[u]) {
            if (!vis[v]) {
                du[v]--;
                if (!vis[v] && du[v] == 1 && f[v] > ck) pq.push({a[v], v});
                break;
            }
        }
        ck++;
    }
    cout << ans << "\n";
    return 0;
}