#include <bits/stdc++.h>
using namespace std; 
#define int long long
const int maxn=2e5+10;
const int mod=1e9+7;
const int i2=5e8+4;
int id,t,n,k,x,y,fac[maxn],ok[maxn],ans,siz[maxn],deg[maxn],F[maxn],ifac[maxn],inv[maxn];
vector<pair<int,int> > v[maxn];
vector<int> dots;
int dp[maxn],ansf;
inline int read()
{
	int x=0;char ch=getchar();
	while(ch<'0' || ch>'9')ch=getchar();
	while(ch>='0' && ch<='9')x=x*10+ch-'0',ch=getchar();
	return x;
}
inline void write(int x)
{
	if(x>=10)write(x/10);
	putchar(x%10+'0');
}
inline int calc(int n,int k)
{
	if(n<=2)return 1;
	int all=fac[n]*i2%mod;
	int bad=(n-k)*(n-k-1)%mod*i2%mod*fac[n-2]%mod;
	return (all-bad);
}
inline void dfs(int x,int fa)
{
	F[x]=fa;siz[x]=0;
	int cnt=0;
	for(int i=0;i<v[x].size();i++)
	{
		int y=v[x][i].first;
		if(y==fa)continue;
		dfs(y,x);
		int delt=siz[y]+ok[v[x][i].second];
		siz[x]+=delt;cnt+=(delt!=0);
	}
	if(siz[x]!=k)cnt++;
	if(cnt>=2)dots.push_back(x);
}
inline int qpow(int a,int b)
{
	int res=1;
	while(b)
	{
		if(b&1)res=res*a%mod;
		a=a*a%mod;
		b>>=1; 
	}
	return res;
}
inline void Sub1()
{
	int res=1;
	for(int i=1;i<=n;i++)res=res*fac[deg[i]-1]%mod;
	write(res);putchar('\n');
}
inline void Sub2()
{
	int res=1,tmp=1;
	for(int i=1;i<=n;i++)tmp=tmp*fac[deg[i]-1]%mod;
	dots.clear();dfs(1,0);
	int del=tmp;
	for(int i=0;i<dots.size();i++)del=del*qpow(deg[dots[i]]-1,mod-2)%mod;
	//printf("tmp %lld,del %lld\n",tmp,del);
	res=tmp*k-del;res=(res%mod+mod)%mod;
	write(res);putchar('\n');
}
inline void dfs2(int x,int fa)
{
	dp[x]=0;
	for(int i=0;i<v[x].size();i++)
	{
		int y=v[x][i].first;
		if(y==fa)continue;
		dfs2(y,x);
		if(ok[v[x][i].second])ansf=(ansf+dp[x])%mod;
		else ansf=(ansf+dp[x]*dp[y])%mod;
		if(ok[v[x][i].second])
		{
			dp[x]=(dp[x]+inv[deg[x]-1])%mod;
			ansf=(ansf+dp[y])%mod;
		}
		else dp[x]=(dp[x]+dp[y]*inv[deg[x]-1])%mod;
	}
}
inline void Sub3()
{
	ansf=0;
	int tmp=1;
	for(int i=1;i<=n;i++)tmp=tmp*fac[deg[i]-1]%mod;
	dfs2(1,0);
	int ans=tmp*(k-ansf);ans=(ans%mod+mod)%mod;
	write(ans);putchar('\n');
}
signed main()
{
	freopen("traverse.in","r",stdin);
	freopen("traverse.out","w",stdout);
	fac[0]=ifac[0]=1;
	for(int i=1;i<maxn;i++)fac[i]=fac[i-1]*i%mod;
	ifac[maxn-1]=qpow(fac[maxn-1],mod-2);
	for(int i=maxn-2;i>=1;i--)ifac[i]=ifac[i+1]*(i+1)%mod;
	for(int i=1;i<maxn;i++)inv[i]=qpow(i,mod-2)%mod;
	id=read();t=read();
	while(t--)
	{
		n=read();k=read();
		for(int i=1;i<=n;i++)v[i].clear(),ok[i]=deg[i]=siz[i]=dp[i]=0;
		for(int i=1;i<n;i++)
		{
			x=read();y=read();
			v[x].push_back(make_pair(y,i));v[y].push_back(make_pair(x,i));
			deg[x]++;deg[y]++;
		}
		for(int i=1;i<=k;i++)x=read(),ok[x]=1;/*
		if(k==1)
		{
			Sub1();
			continue;
		}
		if(k==2)
		{
			Sub2();
			continue;
		}
		if(id==18)
		{
			puts("1");
			continue;
		}
		if(id>=19 && id<=21)
		{
			int ans=calc(n-1,k);ans=(ans%mod+mod)%mod;
			write(ans);putchar('\n');continue;
		}*/
		Sub3();
	}
	return 0;
}