#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60LL;
const int IINF = (1 << 30) - 1;


void solve(){
    int n, m; cin >> n >> m;
    vector<int> p(n); for(int i=0; i<n; i++) cin >> p[i];
    vector<set<int>> T(n);
    for(int i=0; i<n-1; i++){
        int u, v; cin >> u >> v;
        u--; v--;
        T[u].insert(v);
        T[v].insert(u);
    }

    vector<bool> used(n, false);
    set<int> que;
    set<pair<ll, int>> st; for(int i=0; i<n; i++) if((int)T[i].size() == 1) st.insert({p[i], i});
    for(int i=0; i<m; i++){
        int c; cin >> c;
        c--;
        used[c] = true;
        que.insert(c);
        st.erase({p[c], c});
    }

    ll ans = 0LL;
    for(int t=1; ; t++){
        if(st.empty()) break;
        auto [v, i] = *st.rbegin();
        ans += v;
        used[i] = true;
        que.erase(i);
        st.erase({v, i});
        int to = *T[i].begin();
        if(!used[to]){
            T[to].erase(i);
            if((int)T[to].size() == 1) st.insert({p[to], to});
        }

        set<int> nxt;
        for(auto v : que){
            for(int u : T[v]){
                if(used[u]) continue;
                used[u] = true;
                nxt.insert(u);
                st.erase({p[u], u});
            }
        }
        que = nxt;
    }

    cout << ans << endl;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int T=1;
    //cin >> T;
    while(T--) solve();
}