import sys

# sys.setrecursionlimit(1000005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

n = II()
to = [[] for _ in range(n)]
deg = [0]*n
for _ in range(n-1):
    u, v = LI1()
    to[u].append(v)
    to[v].append(u)
    deg[u] += 1
    deg[v] += 1
m = II()
vv=LI1()

go = [0]*n
tr = [0]*n
for v in vv:
    go[v] = 1
    tr[v]+=1
    for u in to[v]:
        tr[u]+=1

one=[0]*n
for u in vv:
    for v in to[u]:
        one[u]+=tr[v]==1
# pDB(tr)
# pDB(one)

tot=n-tr.count(0)
for u in range(n):
    ans=tot-one[u]
    for v in to[u]:
        ans-=one[v]
        if go[v] and tr[v]-go[u]-go[v]==0:ans-=1
    if go[u] or tr[u]>1:ans-=1
    print(ans)