import sys
from sys import stdin
from collections import defaultdict, 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
    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:
        neighborhood = set()
        neighborhood.add(x)
        for y in adj[x]:
            neighborhood.add(y)
        for y in adj[x]:
            for z in adj[y]:
                if z != x and z not in adj[x]:
                    neighborhood.add(z)
        s = 0
        for node in neighborhood:
            s += A[node]
        for node in neighborhood:
            if node != x:
                A[node] = 0
        A[x] = s
        print(s)
    
if __name__ == '__main__':
    main()