#include <iostream>
#include <iomanip>//小数点出力用
//cout << fixed << setprecision(10) << ans;
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
using ll = long long;
using namespace std;
#define modPHash (ll)((1LL<<61)-1)
#define modP (ll)998244353
bool chkrng0idx(int pos, int sup) { return (0 <= pos && pos < sup); }
int clk4(int num) { return (num - 2) * (num % 2); }
void yn(bool tf) { cout << (tf ? "Yes\n" : "No\n"); }

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int N;
    cin >> N;
    int M;
    cin >> M;
    vector<int>P(N);
    for (int i = 0;i < N;i++) {
        cin >> P[i];
    }
    vector<int>nxt[100000];
    vector<int>D(100000);
    for (int i = 1;i < N;i++) {
        int A, B;
        cin >> A >> B;
        A--;
        B--;
        nxt[A].push_back(B);
        nxt[B].push_back(A);
        D[A]++;
        D[B]++;
    }
    vector<int>C(M);
    vector<int>SafeTime(N, 1e9);
    queue<int>Q;
    for (int i = 0;i < M;i++) {
        cin >> C[i];
        C[i]--;
        Q.push(C[i]);
        SafeTime[C[i]] = 0;
    }
    while (!Q.empty()) {
        int now = Q.front();
        Q.pop();
        for (int j = 0;j < nxt[now].size();j++) {
            if (SafeTime[nxt[now][j]] == 1e9) {
                SafeTime[nxt[now][j]] = SafeTime[now] + 1;
                Q.push(nxt[now][j]);
            }
        }
    }
    priority_queue<pair<int,int>>PQ;
    vector<bool>queued(100000);
    for (int i = 0;i < N;i++) {
        if (nxt[i].size() == 1) {
            PQ.push({ P[i], i });
            queued[i] = 1;
        }
    }
    int T = 1;
    ll ans = 0;
    while (!PQ.empty()) {
        while (SafeTime[PQ.top().second] < T) {
            PQ.pop();
            if (PQ.size() == 0)break;
        }
        if (PQ.size() == 0)break;

        ans += (ll)PQ.top().first;
        int now = PQ.top().second;
        PQ.pop();
        for (int j = 0;j < nxt[now].size();j++) {
            D[nxt[now][j]]--;
            if (queued[nxt[now][j]] == 0 && D[nxt[now][j]] == 1) {
                PQ.push({ P[nxt[now][j]], nxt[now][j] });
                queued[nxt[now][j]] = 1;
            }
        }
        T++;
    }
    cout << ans;
}