#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, n) for(int i=0;i<(n);++i)
#define rep1(i, n) for(int i=1;i<=(n);i++)
#define ll long long
using mint = modint998244353;
using P = pair<ll,ll>;
using lb = long double;
using T = tuple<ll, ll, ll>;
#ifdef LOCAL
#  include <debug_print.hpp>
#  define dbg(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define dbg(...) (static_cast<void>(0))
#endif

int main()
{
    int n, m;
    cin >> n >> m;
    vector<int> p(n);
    rep(i,n) cin >> p[i];
    vector<vector<int>> g(n);
    vector<int> d(n);
    rep(i,n-1) {
        int a, b;
        cin >> a >> b;
        --a;--b;
        g[a].push_back(b);
        g[b].push_back(a);
        d[a]++;
        d[b]++;
    }
    vector<int> c(m);
    rep(i,m) cin >> c[i];
    rep(i,m) --c[i];
    priority_queue<P> pq;
    rep(i,n) {
        if(d[i]==1) pq.emplace(p[i],i);
    }
    vector<int> used(n);
    queue<int> q;
    rep(i,m) {
        used[c[i]]=1;
        q.push(c[i]);
    }
    ll ans = 0;
    while(!pq.empty()) {
        dbg(pq,used);
        auto [val, id] = pq.top();pq.pop();
        if(used[id]) continue;
        ans += val;
        for(int v : g[id]) {
            d[v]--;
            if(d[v]==1) pq.emplace(p[v], v);
        }
        vector<int> vs;
        while(!q.empty()) {
            int u = q.front();q.pop();
            for(int v : g[u]) {
                if(used[v]) continue;
                vs.push_back(v);
                used[v] = 1;
            }
        }
        for(int v : vs) q.push(v);
        // dbg(pq,q);
    }
    cout << ans << endl;
    return 0;
}