#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	int n; cin >> n;
	vector<int> a(n-1), b(n-1);
	rep(i,0,n-1){
		cin >> a[i] >> b[i];
		a[i]--;
		b[i]--;
	}
	int m; cin >> m;
	vector<int> v(m);
	vector<bool> obake(n);
	rep(i,0,m){
		cin >> v[i];
		v[i]--;
		obake[v[i]] = 1;
	}

	vector ikeru(n, vector<int>(0));
	rep(i,0,n-1){
		ikeru[a[i]].push_back(b[i]);
		ikeru[b[i]].push_back(a[i]);
	}

	vector<int> cnt(n);
	rep(i,0,n){
		if (obake[i]){
			cnt[i]++;
			for (int j: ikeru[i]){
				cnt[j]++;
			}
		}
	}

	vector<int> ans(n);
	vector<int> less2(n);

	rep(i,0,n){
		if (obake[i]){
			for (int j: ikeru[i]){
				if (cnt[j] < 2){
					less2[i]++;
				}
			}
		}
	}

	int base = 0;
	rep(i,0,n){
		if (cnt[i] > 0) base++;
	}

	rep(i,0,n){
		if (obake[i]){
			ans[i] += less2[i];
			ans[i] += 1;
			for (int j: ikeru[i]){
				if (obake[j]){
					ans[i] += less2[j];
					if (cnt[j] == 2){
						ans[i] += 1;
					}
				}
			}
		}else{
			int obakecount = 0;
			for (int j: ikeru[i]){
				if (obake[j]){
					obakecount++;
					ans[i] += less2[j];
					if (cnt[j] == 1){
						ans[i]++;
					}
				}
			}

			if (obakecount >= 2){
				ans[i]++;
			}
		}
		cout << base - ans[i] << '\n';
	}
}