#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint998244353;
//const int mod = 998244353;
//using mint = modint1000000007;
//const int mod = 1000000007;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<vector<int>>to(n);
	rep(i, n - 1) {
		int a, b; cin >> a >> b;
		a--, b--;
		to[a].push_back(b);
		to[b].push_back(a);
	}
	vector<int>g(n);
	int m; cin >> m;
	rep(i, m) {
		int v; cin >> v;
		v--;
		g[v]++;
	}
	vector<int>cnt(n);//何匹に監視されているか
	rep(i, n) {
		if (!g[i]) continue;
		cnt[i]++;
		for (auto j : to[i]) cnt[j]++;
	}
	vector<int>c1(n);//gから距離1かつそれにのみ監視されているものの個数
	rep(i, n) {
		if (!g[i]) continue;
		for (auto j : to[i]) c1[i] += (cnt[j] == 1);
	}
	int cur = 0;
	rep(i, n)if (cnt[i])cur++;
	rep(i, n) {
		int ans = cur;
		if (cnt[i])ans--;
		for (auto j : to[i]) {
			if (!cnt[j])continue;
			int val = cnt[j] - g[i] - g[j];
			if (!val)ans--;
			if (g[j]) ans -= c1[j] - (1 == cnt[i]);
		}
		cout << ans << endl;
	}
	return 0;
}