import sys
from sys import stdin

def main():
    sys.setrecursionlimit(1 << 25)
    input = sys.stdin.read().split()
    ptr = 0
    N = int(input[ptr])
    ptr += 1

    adj = [set() for _ in range(N)]
    for _ in range(N-1):
        u = int(input[ptr])
        v = int(input[ptr+1])
        adj[u].add(v)
        adj[v].add(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]))

    state = [0] * N  # 0: initial, 1: active as center, 2: deactivated
    current_value = [0] * N
    for i in range(N):
        current_value[i] = A[i]

    for x in queries:
        sum_val = 0

        # Process x itself
        if state[x] != 2:
            sum_val += current_value[x]
        state[x] = 2  # Temporarily mark as deactivated

        # Process direct neighbors
        for y in adj[x]:
            if state[y] != 2:
                sum_val += current_value[y]
            state[y] = 2

        # Process neighbors of neighbors
        adj_x = adj[x]
        for y in adj[x]:
            for z in adj[y]:
                if z == x or z in adj_x:
                    continue
                if state[z] != 2:
                    sum_val += current_value[z]
                state[z] = 2

        # Reactivate x and set its value
        state[x] = 1
        current_value[x] = sum_val

        print(sum_val)

if __name__ == '__main__':
    main()