#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main () {
	int N, M;
	cin >> N >> M;
	std::vector<ll> P(N);
	for (ll& a : P) cin >> a;
	vector<vector<int>> gr(N);
	for (int i = 1; i < N; i ++) {
		int a, b;
		cin >> a >> b;
		gr[--a].push_back(--b);
		gr[b].push_back(a);
	}
	vector<int> D(N, N + 100);
	queue<int> que;
	for (int i = 0; i < M; i ++) {
		int a;
		cin >> a;
		D[--a] = 0;
		que.push(a);
	}
	while (!que.empty()) {
		int u = que.front();
		que.pop();
		for (auto& v : gr[u]) {
			if (D[v] > D[u] + 1) {
				D[v] = D[u] + 1;
				que.push(v);
			}
		}
	}
	ll ans = 0;
	using X = pair<ll, int>;
	priority_queue<X> pque;
	vector<int> S(N, 0);
	for (int i = 0; i < N; i ++) S[i] = gr[i].size();
	for (int i = 0; i < N; i ++) {
		if (S[i] == 1) {
			pque.emplace(P[i], i);
		}
	}
	for (int i = 0; i < N; i ++) {
		ll p; int u;
		while (!pque.empty()) {
			tie(p, u) = pque.top();
			if (D[u] > i) break;
			pque.pop();
		}
		if (pque.empty()) break;
		ans += p;
		pque.pop();
		for (auto& v : gr[u]) {
			S[v] --;
			if (S[v] == 1) {
				pque.emplace(P[v], v);
			}
		}
	}
	cout << ans << endl;
}