#include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = long long;
using std::cout;
using std::endl;
using std::cin;

template<typename T>
std::vector<T> make_v(size_t a){return std::vector<T>(a);}

template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
  return std::vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

int main() {
	int n; scanf("%d", &n);
	assert(2 <= n and n <= (int)1e5);
	
	std::vector<std::set<int>> g(n);
	for(int i = 0; i < n - 1; i++) {
		int a, b; scanf("%d%d", &a, &b);

		assert(0 <= a and a < n);
		assert(0 <= b and b < n);
		
		g[a].insert(b);
		g[b].insert(a);
	}

	std::vector<i64> a(n);
	for(int i = 0; i < n; i++) {
		scanf("%d", &a[i]);
		
		assert(0 <= a[i] and a[i] <= (int)1e5);
	}

	int q; scanf("%d", &q);
	assert(1 <= q and q <= (int)1e5);

	std::vector<int> par(n, -1),  tan(n);
	auto dfs = [&](auto && dfs, int v, int p) -> void {
		par[v] = p;

		for(auto e: g[v]) {
			if(e == p) continue;
			tan[v] += a[e];
			
			dfs(dfs, e, v);
		}
	};
	dfs(dfs, 0, -1);

	std::vector<bool> kiri(n, false);
	while(q--) {
		int v; scanf("%d", &v);
		assert(0 <= v and v < n);

		if(par[v] != -1 and kiri[par[v]]) a[v] = 0;
		if(par[v] != -1) {
			int p = par[v];
			a[v] = tan[p];
			tan[p] = 0;
			kiri[p] = true;
			
			a[v] += a[p];
			a[p] = 0;

			if(par[p] != -1) {
				a[v] += a[par[p]];
				a[par[p]] = 0;
			}
		}
		for(auto e: g[v]) {
			a[v] += tan[e];
			tan[e] = 0;
			kiri[e] = true;

			if(kiri[v]) a[e] = 0;
			a[v] += a[e];
			a[e] = 0;
			
			g[e].insert(v);
		}
		tan[v] = 0;
		if(par[v] != -1) tan[par[v]] = a[v];
		
		g[v].clear();
		
		printf("%lld\n", a[v]);
	}
	return 0;
}