import sys
from sys import stdin
from collections import deque

def main():
    sys.setrecursionlimit(1 << 25)
    input = sys.stdin.read().split()
    ptr = 0
    N = int(input[ptr])
    ptr += 1
    adj = [[] for _ in range(N)]
    for _ in range(N - 1):
        u = int(input[ptr])
        v = int(input[ptr + 1])
        adj[u].append(v)
        adj[v].append(u)
        ptr += 2

    # Precompute S_x for all x
    S = [[] for _ in range(N)]
    for x in range(N):
        seen = set()
        seen.add(x)
        for y in adj[x]:
            if y not in seen:
                seen.add(y)
            for z in adj[y]:
                if z != x and z not in seen:
                    seen.add(z)
        S[x] = list(seen)

    A = list(map(int, input[ptr:ptr + N]))
    ptr += N
    Q = int(input[ptr])
    ptr += 1
    queries = list(map(int, input[ptr:ptr + Q]))
    
    for x in queries:
        total = 0
        nodes = S[x]
        for u in nodes:
            total += A[u]
            A[u] = 0
        A[x] = total
        print(total)
        
if __name__ == "__main__":
    main()