#include <bits/stdc++.h>
using namespace std;
const int md=1000000007;
int n,m,r,a,b,p,fa[10010],in[10010],ssiz[10010];
unsigned long long tmp,sum1,sum2,ans[10010];
bool visit[10010];
vector<int> ver[10010],son[10010];
queue<int> q;
inline void dfs(const int &i){
	visit[i]=true;
	const int siz=ver[i].size();
	for(int j=0;j<siz;++j){
		const int &now=ver[i][j];
		if(visit[now]) continue;
		fa[now]=i;++in[i];
		son[i].push_back(now);
		dfs(now);
	}
}
int main(){
	scanf("%d%d%d",&n,&r,&m);
	for(int i=1;i<n;++i){
		scanf("%d%d",&a,&b);
		ver[a].push_back(b);
		ver[b].push_back(a);
	}	
	dfs(r);memset(visit,0,sizeof(visit));
	for(int i=1;i<=n;++i){
		ssiz[i]=1;
		if(!in[i]) q.push(i);
	}
	while(q.size()){
		a=q.front();q.pop();
		visit[a]=true;
		ssiz[fa[a]]+=ssiz[a];
		if(!(--in[fa[a]])) q.push(fa[a]);
	}//拓扑统计
	while(m--){
		scanf("%d",&p);
		const int siz=son[p].size();
		if(ans[p]) printf("%lld\n",ans[p]);
		else if(!siz) printf("%lld\n",ans[p]=1);
		else if(siz==1) printf("%lld\n",ans[p]=(ssiz[son[p][0]]<<1)|1);
		else{
			for(int i=0;i<siz;++i) sum1+=ssiz[son[p][i]]+1;
			for(int i=0;i<siz;++i){
				sum2+=(ssiz[son[p][i]]+1)*(sum1-ssiz[son[p][i]]-1);
				sum2%=md;
			}
			printf("%lld\n",ans[p]=sum2-1);
			sum1=sum2=0;
		}
	}
	return 0;
}