from sys import stdin,setrecursionlimit#,set_int_max_str_digits
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
setrecursionlimit(2000000) # これこどふぉだと無理
#set_int_max_str_digits(200010)
mod = 998244353 
ii = lambda :int(stdin.readline())
mi = lambda :map(int,stdin.readline().split())
li = lambda :list(mi())
gmi = lambda :map(lambda x: int(x) - 1, stdin.readline().split())
gi = lambda :list(map(lambda x: 0 if x == "." else 1,input())) # グリッド入力受け取り
py = lambda :print("Yes")
pn = lambda :print("No")
pf = lambda :print("First") 
ps = lambda :print("Second")
pyn = lambda x: print("Yes") if x else print("No")
vec = [(1,0),(-1,0),(0,-1),(0,1)]
vec1 = [(1,0),(1,1),(0,1),(-1,1),(-1,0),(-1,-1),(0,-1),(1,-1)] #8方向
vec2 = [(1,1),(1,0),(0,-1),(-1,-1),(-1,0),(0,1)] # 六角形グリッド
inf = 2*10**18
from collections import defaultdict,deque
from heapq import heappop,heappush


n,m = mi() 
p = li()

g = defaultdict(list) 

for _ in range(n-1):
    u,v = gmi() 
    g[u].append(v) 
    g[v].append(u) 

dist = [inf]*n 
c = list(gmi())
for i in c:
    dist[i] = 0 
que = deque(c) 

while que:
    v = que.popleft() 
    for i in g[v]:
        if dist[i] > dist[v] + 1:
            dist[i] = dist[v] + 1 
            que.append(i) 

ans = 0 
time = 0 

que = []
for i in range(n):
    if len(g[i]) == 1:
        heappush(que,(-p[i],i))

while que:
    x,v = heappop(que) 
    x *= -1 
    if dist[v] > time:
        #print(v+1,x)
        ans += x
        time += 1 
        for i in g[v]:
            g[i].remove(v)
            if len(g[i]) == 1:
                heappush(que,(-p[i],i))

print(ans)