import sys
input = sys.stdin.readline

class Fenwick_Tree:
    def __init__(self, n):
        self._n = n
        self.data = [0] * n

    def add(self, p, x):
        assert 0 <= p < self._n
        p += 1
        while p <= self._n:
            self.data[p - 1] += x
            p += p & -p

    def sum(self, l, r):
        assert 0 <= l <= r <= self._n
        return self._sum(r) - self._sum(l)

    def _sum(self, r):
        s = 0
        while r > 0:
            s += self.data[r - 1]
            r -= r & -r
        return s

    def get_size(self, x):
        x = self.find(x)
        while r > 0:
            s += self.data[r - 1]
            r -= r & -r
        return s

    def get(self, k):
        k += 1
        x, r = 0, 1
        while r < self._n:
            r <<= 1
        len = r
        while len:
            if x + len - 1 < self._n:
                if self.data[x + len - 1] < k:
                    k -= self.data[x + len - 1]
                    x += len
            len >>= 1
        return x


N = int(input())
G = [[] for i in range(N)]
for i in range(N - 1):
    u, v = map(int, input().split())
    u, v = u - 1, v - 1
    G[u].append(v)
    G[v].append(u)
    
M = int(input())
V = list(map(int, input().split()))
for i in range(M):
    V[i] -= 1
for i in range(N):
    G[i].append(i)
V = set(V)

T = Fenwick_Tree(N)
cnt = [0] * N
for i in V:
    for u in G[i]:
        cnt[u] += 1
        if cnt[u] == 1:
            T.add(u, 1)
            
for i in range(N):
    for u in G[i]:
        if u in V:
            for v in G[u]:
                cnt[v] -= 1
                if cnt[v] == 0:
                    T.add(v, -1)
    print(T.sum(0, N))
    for u in G[i]:
        if u in V:
            for v in G[u]:
                cnt[v] += 1
                if cnt[v] == 1:
                    T.add(v, 1)