#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll INF = (1LL << 60);
int MN = 2e6;
vector<vector<int>> G(MN);
vector<ll> dp1(MN, 0), DP1(MN, 0);
vector<ll> dp2(MN, 0), DP2(MN, 0);
vector<int> A(MN, 0);
vector<int> PAR(MN, -1);
void dfs1(int v, int par) {
	PAR[v] = par;
	for (auto nv : G[v]) {
		if (nv == par) continue;
		dfs1(nv, v);
		if (A[nv] + dp1[nv] > 0) dp1[v] += 2 + dp1[nv];
	}
}
void dfs2(int v, int par) {
	ll s = 0;
	for (auto nv : G[v]) {
		if (nv == par) {
			if (A[nv] + DP1[v] > 0) s += 2 + DP1[v];
		} else {
			if (A[nv] + dp1[nv] > 0) s += 2 + dp1[nv];
		}
	}
	for (auto nv : G[v]) {
		if (nv == par) continue;
		DP1[nv] = s;
		if (A[nv] + dp1[nv] > 0) DP1[nv] -= 2 + dp1[nv];
		dfs2(nv, v);
	}
}
void DFS(int v, int par) {
	ll mins = INF;
	dp2[v] = dp1[v];
	for (auto nv : G[v]) {
		if (nv == par) continue;
		DFS(nv, v);
		if (A[nv] + dp1[nv] > 0) {
			mins = min(mins, dp2[nv] - dp1[nv] - 1);
		}
	}
	if (mins != INF) dp2[v] += mins;
}
void DFS2(int v, int par) {
	multiset<ll> sets;
	ll s = 0;
	for (auto nv : G[v]) {
		if (nv == par) {
			if (A[nv] + DP1[v] == 0) continue;
			s += 2 + DP1[v];
			sets.insert(DP2[v] - DP1[v] - 1);		
		} else {
			if (A[nv] + dp1[nv] == 0) continue;
			s += 2 + dp1[nv];
			sets.insert(dp2[nv] - dp1[nv] - 1);
		}
	}
	for (auto nv : G[v]) {
		if (nv == par) continue;
		DP2[nv] = s;
		if (A[nv] + dp1[nv] > 0) {
			DP2[nv] -= 2 + dp1[nv];
			sets.erase(sets.find(dp2[nv] - dp1[nv] - 1));
		}
		if (!sets.empty()) {
			DP2[nv] += *sets.begin();
		}
		if (A[nv] + dp1[nv] > 0) sets.insert(dp2[nv] - dp1[nv] - 1);
		DFS2(nv, v);
	}
}
int main() {
	int N, K;cin >> N >> K;
	for (int i = 0;i < N - 1;i++) {
		int u, v;cin >> u >> v;
		u--;v--;
		G[u].push_back(v);
		G[v].push_back(u);
	}
	for (int i = 0;i < K;i++) {
		int d;cin >> d;
		d--;
		A[d] = 1;
	}
	int r;
	r = 0;
	//cin >> r;
	dfs1(r, r);
	dfs2(r, r);
	DFS(r, r);
	DFS2(r, r);
	for (int v = 0;v < N;v++) {
		ll ans = 0;
		ll mins = INF;
		for (auto nv : G[v]) {
			if (nv == PAR[v]) {
				if (A[nv] + DP1[v] > 0) {
					ans += 2 + DP1[v];
				       mins = min(mins, DP2[v] - DP1[v] - 1);	
				}
			} else {
				if (A[nv] + dp1[nv] > 0) {
					ans += 2 + dp1[nv];
					mins = min(mins, dp2[nv] - dp1[nv] - 1); 
				}
			}
		}
		if (mins != INF) ans += mins;
		cout << ans << endl;
	}
}