#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_back
#define eb emplace_back
#define Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<typename T> using pq = priority_queue<T,vector<T>,greater<T>>;
using P = pair<int,int>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}

int main() {
  int n, m;
  cin >> n >> m;
  vector<int> p(n);
  rep(i,0,n) cin >> p[i];
  vector<set<int>> G(n);
  rep(i,0,n-1) {
    int u, v;
    cin >> u >> v;
    --u, --v;
    G[u].emplace(v), G[v].emplace(u);
  }
  vector<int> dist(n, -1);
  queue<int> que0;
  rep(i,0,m) {
    int c;
    cin >> c;
    --c;
    dist[c] = 0;
    que0.emplace(c);
  }
  while(!que0.empty()) {
    int v = que0.front();
    que0.pop();
    for (int nv : G[v]) {
      if (dist[nv] == -1) {
        dist[nv] = dist[v] + 1;
        que0.emplace(nv);
      }
    }
  }
  pq<P> que;
  rep(i,0,n) {
    if (len(G[i]) == 1) {
      que.emplace(-p[i], i);
    }
  }
  ll ans = 0;
  rep(t,1,n+1) {
    while(!que.empty()) {
      if (dist[que.top().se] < t) {
        que.pop();
      } else {
        break;
      }
    }
    if (que.empty()) break;
    int v = que.top().se;
    ans -= que.top().fi;
    que.pop();
    int nv = *G[v].begin();
    G[nv].erase(v);
    if (len(G[nv]) == 1) {
      que.emplace(-p[nv], nv);
    }
  }
  cout << ans << endl;
  return 0;
}