#include <bits/stdc++.h>
#include <stdlib.h>
#include <atcoder/all>
using namespace atcoder;
using namespace std;
#define rep(i, a, n) for(ll i = a; i < n; i++)
#define rrep(i, a, n) for(ll i = a; i >= n; i--)
#define inr(l, x, r) (l <= x && x < r)
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(x) (x).begin(), (x).end()
//constexpr ll MOD = 1000000007;
constexpr ll MOD = 998244353;
constexpr int IINF = 1001001001;
constexpr ll INF = 1LL<<60;
template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}

using mint = modint998244353;

ll gcd(ll a, ll b){
    if(a%b == 0){
      return b;
    }else{
      return gcd(b, a%b);
    }
}

ll lcm(ll a, ll b){
    return a*b / gcd(a, b);
}

ll powMod(ll x, ll n, ll mod) {
    if (n == 0) return 1 % mod;
    ll val = powMod(x, n / 2, mod);
    val *= val;
    val %= mod;
    if (n % 2 == 1) val *= x;
    return val % mod;
}

int main() {
    ll n, m; cin >> n >> m;
    vector<ll> p(n), c(m);
    rep(i,0,n) cin >> p[i];
    vector<vector<ll>> g(n);
    rep(i,0,n-1){
        ll a, b; cin >> a >> b;
        a--;b--;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    rep(i,0,m) cin >> c[i], c[i]--;
    priority_queue<pll> pq;
    vector<ll> d(n,-1);
    queue<ll> q;
    for(auto x: c){
        d[x] = 0;
        q.push(x);
    }
    while(!q.empty()){
        ll v = q.front(); q.pop();
        for(auto nv: g[v]){
            if(d[nv] == -1){
                d[nv] = d[v]+1;
                q.push(nv);
            }
        }
    }
    vector<ll> deg(n),check(n,0);
    rep(i,0,n) deg[i] = g[i].size();
    rep(i,0,n){
        if(d[i] != 0 && g[i].size() == 1) pq.push({p[i], i});
    }
    ll ans = 0, cnt = 0;
    while(!pq.empty()){
        auto [x, i] = pq.top(); pq.pop();
        // cout << x << " " << i << " " << cnt <<  " " << d[i] << endl;
        if(d[i] > cnt && !check[i]){
            check[i] = 1;
            cnt++;
            ans += x;
            for(auto nv: g[i]){
                deg[nv]--;
                if(deg[nv] == 1 && d[nv] != 0){
                    pq.push({p[nv], nv});
                }
            }
        }
       
    }
    cout << ans << endl;
    return 0;
}