#include<iostream>
#include<cstdio>
#include<cctype>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
const int maxn=10e6+3;
int n,u,ui,vi,m,mi,fa[maxn];
vector<int> g[maxn];
queue<int> q;
bool inq[maxn];
inline void in(int &x){
    x=0;int f=1;char t=getchar();
    while(!isdigit(t)){if(t=='-')f=-1;t=getchar();}
    while(isdigit(t)){x=x*10+t-48;t=getchar();}
    x*=f;
}
inline void bfs(int x){
	q.push(x);fa[x]=-1;inq[x]=1;
	while(!q.empty()){
		int now=q.front();q.pop();
		for(int i=0;i<g[now].size();i++){
			if(!inq[g[now][i]]){
				q.push(g[now][i]);
				inq[g[now][i]]=1;
				fa[g[now][i]]=now;
			}
		}
	}
}
inline void work(){
	in(n);in(u);
	for(int i=1;i<n;i++){
		in(ui);in(vi);
		g[ui].push_back(vi);
		g[vi].push_back(ui);
	}
	bfs(u);
	in(m);
	for(int i=1;i<=m;i++){
		in(mi);
		printf("%d ",fa[mi]);
	}
}
inline int mian(){
	freopen("wgs.in","r",stdin);
	freopen("wgs.out","w",stdout);
	work();
}
int miku=mian();
int main(){;}