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

#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());    //can be used by calling rng() or shuffle(A, A+n, rng)
inline long long rand(long long x, long long y) { return rng() % (y+1-x) + x; } //inclusivesss
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }

using ll=int; 
using ld=long double;
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
using pi=pair<ll,ll>; using spi=pair<ll,pi>; using dpi=pair<pi,pi>; 

long long LLINF = 1e18;
int INF = 1e9+1e6;
#define MAXN (200006)
ll n, k, dist[MAXN][18], mi[MAXN], cp[MAXN], sz[MAXN], total, cdepth[MAXN];
vector<ll> v[MAXN], val[MAXN];
bitset<MAXN> done;
namespace cd {
	void dfs1(ll x,ll p) {
		++ total, sz[x]=1;
		for(auto i:v[x]) if(!done[i]&&i^p) {
			dfs1(i, x), sz[x]+=sz[i];
		}
	}
	ll dfs2(ll x,ll p) {
		for(auto i:v[x]) if(i^p&&!done[i]&&sz[i]>total/2) return dfs2(i, x);
		return x;
	}
	void find_dist(ll x,ll p,ll d) {
		for(auto i:v[x]) if(i^p&&!done[i]) {
			dist[i][d]=dist[x][d]+1;
			find_dist(i,x,d);
		}
	}
	void dfs3(ll x,ll p=-1,ll d=0) {
		total=0;
		dfs1(x,x);
		x=dfs2(x,x);
		find_dist(x,x,d);
		cp[x]=p;
		done[x]=1;
		cdepth[x]=d;
		val[x].resize(total, 0);
		for(auto i:v[x]) if(!done[i]) {
			dfs3(i, x, d+1);
		}
	}
	void update(ll x,ll o) {
		if(x==-1) return;
		ll y = mi[o] - dist[o][cdepth[x]];
		if(y>0) {
			val[x][min(siz(val[x]), y)-1]=max(val[x][min(siz(val[x]), y)-1], mi[o]);
		}
		update(cp[x], o);
	}
	ll query(ll x,ll o) {
		if(x==-1) return 0;
		return max(val[x][dist[o][cdepth[x]]], query(cp[x], o));
	}
}
int main() {
	FAST
	cin>>n;
	FOR(i,0,n-2){
		ll a,b;
		cin>>a>>b;
		v[a].eb(b),v[b].eb(a);
	}
	cd::dfs3(1);
	// FOR(i,1,n)cerr<<cp[i]<<' ';cerr<<'\n';
	cin>>k;
	fill(mi,mi+MAXN,n);
	queue<ll> q;
	FOR(i,0,k-1){
		ll a;
		cin>>a;
		mi[a]=0;
		q.emplace(a);
	}
	while(q.size()){
		ll x=q.front();
		q.pop();
		for(auto i:v[x]) if(mi[i] == n) {
			mi[i] = mi[x] + 1;
			q.emplace(i);
		}
	}
	FOR(i,1,n) {
		cd::update(i, i);
	}
	FOR(i,1,n) {
		DEC(j,siz(val[i])-2,0) val[i][j]=max(val[i][j],val[i][j+1]);
	}
	FOR(i,1,n)cout<<cd::query(i,i)<<' ';cout<<'\n';
}
