import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
sys.setrecursionlimit(10**7)
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################
# 全方位木DP
import sys
input = sys.stdin.readline
from collections import deque

N,K = na()
X = [[] for i in range(N)]
for i in range(N-1):
    x, y = map(int, input().split())
    X[x-1].append(y-1)
    X[y-1].append(x-1)
D = na()
MO = 10**7
DD = [0 for i in range(N)]
for i in D:
    DD[i-1] = MO
P = [-1] * N
Q = deque([0])
R = []
while Q:
    i = deque.popleft(Q)
    R.append(i)
    for a in X[i]:
        if a != P[i]:
            P[a] = i
            X[a].remove(i)
            deque.append(Q, a)

##### Settings
unit = (0,0)
merge = lambda a, b: (max(a[0],b[0],a[0]+b[0]),max(a[1],b[1],a[0]+b[1],a[1]+b[0]))
adj_bu = lambda a, i: (a[0]-2+DD[i],a[1]-1+DD[i])
adj_td = lambda a, i, p: (a[0]-2+DD[p],a[1]-1+DD[p])
adj_fin = lambda a, i: (a[0]+DD[i],a[1]+DD[i])
#####

ME = [unit] * N
# 始めはres_bu[i](pを除いたもの)、のちにres[i]
XX = [(1,0)] * N
TD = [unit] * N
for i in R[1:][::-1]:
    XX[i] = adj_bu(ME[i], i)
    p = P[i]
    ME[p] = merge(ME[p], XX[i])
XX[R[0]] = adj_fin(ME[R[0]], R[0])

#print("ME =", ME) # Merge before adj
#print("XX =", XX) # Bottom-up after adj

for p in R:
    # 左からとres_td[p]
    ac = TD[p]
    for i in X[p]:
        # 左累積res_bu[c]とres_td[p]を入れとく
        TD[i] = ac
        # 左累積にres_bu[i]を追加する
        ac = merge(ac, XX[i])
    # 右から
    ac = unit
    for i in X[p][::-1]:
        # TD[i]を確定する
        TD[i] = adj_td(merge(TD[i], ac), i, p)
        # 右累積に追加
        ac = merge(ac, XX[i])
        # res[i]を確定する ME[i](子側)TD[i](親側)
        XX[i] = adj_fin(merge(ME[i], TD[i]), i)

#print("TD =", TD) # Top-down after adj
#print("XX =", XX) # Final Result

print(*[MO*K-i[1] for i in XX], sep = "\n")