n, m = map(int, input().split())
P = list(map(int, input().split()))
node = [[] for _ in range(n)]
for _ in range(n-1):
    u, v = [int(x)-1 for x in input().split()]
    node[u].append(v)
    node[v].append(u)
C = list(map(int, input().split()))
D = [-1] * n
for i in range(len(C)):
    C[i] -= 1
    D[C[i]] = 0

from collections import deque
dq = deque(C)
while dq:
    now = dq.popleft()
    for nxt in node[now]:
        if D[nxt] == -1:
            D[nxt] = D[now] + 1
            dq.append(nxt)

I = [i for i in range(n)]
I.sort(key = lambda x: -P[x])
ans = 0
cnt = 0
V = [0] * n
for now in range(n):
    for nxt in node[now]:
        if now < nxt:
            V[now] += 1
            V[nxt] += 1

from heapq import *
hq = []
for now in range(n):
    if V[now] == 1:
        heappush(hq, -P[now] * n + now)

while hq:
    mask = heappop(hq)
    now = mask % n
    if D[now] > cnt:
        ans += P[now]
        cnt += 1
        for nxt in node[now]:
            V[nxt] -= 1
            V[now] -= 1
            if V[nxt] == 1:
                heappush(hq, -P[nxt] * n + nxt)

print(ans)