#include<bits/stdc++.h>
using namespace std;
using ll=long long;
template<typename A>
using vc=vector<A>;
inline int read()
{
	int s=0,w=1;char ch;
	while((ch=getchar())>'9'||ch<'0') if(ch=='-') w=-1;
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
inline ll lread()
{
	ll s=0,w=1;char ch;
	while((ch=getchar())>'9'||ch<'0') if(ch=='-') w=-1;
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
const int mod=1000000007;
vc<int>g[100005];
vc<int>w[100005];
bool is[100005];
ll jc[100005];
ll inv[100005];
int fa[100005];
ll dp[100005];
int n,m;
ll ans,V;
inline void clear()
{
	for(int i=1;i<=n;i++) g[i].clear(),w[i].clear();
}
inline ll qow(ll a,ll b)
{
	ll ans=1;
	while(b)
	{
		if(b&1) ans=ans*a%mod;
		a=a*a%mod;
		b>>=1;
	}
	return ans;
}
void dfs(int num)
{
	//dp[num]
	ll sum=0;dp[num]=0;
	for(unsigned i=0;i<g[num].size();i++)
	{
		int p=g[num][i],id=w[num][i];
		if(p==fa[num]) continue;
		fa[p]=num,dfs(p);
		
		ll t=dp[p];
		if(is[id])
		{
			t=(t-1-dp[p])%mod;
			ans=(ans-1-dp[p])%mod; 
		}
		dp[num]=(dp[num]+t)%mod;
		
		if(g[num].size()>=2)
		{
			ll val=sum*t%mod;
			val=val*inv[g[num].size()-1]%mod;
			val=val*jc[g[num].size()-2]%mod;
			ans=(ans+val)%mod;
		}
		(sum+=t)%=mod;
	}
	if(g[num].size()>1)
	{
		dp[num]=dp[num]*inv[g[num].size()-1]%mod;
		dp[num]=dp[num]*jc[g[num].size()-2]%mod;
	}
//	printf("dp[%d]=%lld\n",num,dp[num]);
}
inline void solve()
{
	n=read(),m=read(),jc[0]=inv[0]=1;
	for(int i=1;i<n;i++)
	{
		int u=read(),v=read();is[i]=0;
		g[u].push_back(v);w[u].push_back(i);
		g[v].push_back(u);w[v].push_back(i);
	}
	for(int i=1;i<=n;i++)
	{
		jc[i]=jc[i-1]*i%mod;
		inv[i]=qow(jc[i],mod-2);
	}
	for(int i=1;i<=m;i++) is[read()]=1;
	
	ans=0,V=1;
	for(int i=1;i<=n;i++) V=V*jc[g[i].size()-1]%mod;
//	printf("V=%lld\n",V);
	dfs(1);
	ans=-ans*V%mod;
	ans=(ans%mod+mod)%mod;
	printf("%lld\n",ans);
}
int main()
{
	freopen("traverse.in","r",stdin);
	freopen("traverse.out","w",stdout);
	read();int T=read();
	while(T--) solve(),clear();
	return 0;
}
/*
1 1
7 4
1 2
1 3
2 4
2 5
3 6
1 7
3 4 5 6 
*/