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

const int N=1e5+5;
const int Mod=1e9+7;

vector <int> g[N], w[N];
long long jc[N], inv[N], dp[N], tot;
bool key[N];

void dfs(int x,int fa)
{
	long long sum=0;
	for(int i=0;i<g[x].size();i++)
	{
		int to=g[x][i];
		if(to!=fa)
		{
			dfs(to,x);
			if(key[w[x][i]])
			{
				(tot += (-1-dp[to]*inv[g[to].size()-1])) %= Mod;
				dp[to]=-1;
			}
			else
				dp[to]=dp[to]*inv[g[to].size()-1]%Mod;

			(tot += sum*dp[to]%Mod*inv[g[x].size()-1]) %= Mod;
			(sum += dp[to]) %= Mod;
		}
	}
	dp[x]=sum;
}

inline int read()
{
	char c=getchar();
	while(c<'0' || c>'9')
		c=getchar();

	int ans=0;
	while('0'<=c && c<='9')
	{
		ans=ans*10+c-'0';
		c=getchar();
	}
	return ans;
}

void work()
{
	int n=read(),k=read();
	for(int i=1;i<=n;i++)
		g[i].clear(), w[i].clear();
	tot=0;

	memset(key,0,sizeof(key));
	memset(dp,0,sizeof(dp));
	for(int i=1;i<n;i++)
	{
		int x=read(),y=read();
		g[x].push_back(y);
		g[y].push_back(x);
		w[x].push_back(i);
		w[y].push_back(i);
	}

	for(int i=1;i<=k;i++)
	{
		int x=read();
		key[x]=true;
	}

	inv[1]=inv[0]=1;
	for(int i=2;i<=n;i++)
		inv[i]=((-Mod/i)*inv[Mod%i]%Mod+Mod)%Mod;

	jc[0]=1;
	for(int i=1;i<=n;i++)
		jc[i]=jc[i-1]*i%Mod;

	long long ans=1;
	for(int i=1;i<=n;i++)
	{
		if(g[i].size()>1)
			(ans *= g[i].size()-1) %= Mod;
		if(g[i].size()>2)
			(ans *= jc[g[i].size()-2]) %= Mod;
	}

	dfs(1,-1);
	tot=-tot;
	printf("%lld\n",(ans*tot%Mod+Mod)%Mod);
}

int main()
{
	freopen("traverse.in","r",stdin);
	freopen("traverse.out","w",stdout);
	int c=read(),T=read();
	while(T--)
		work();
	return 0;
}