#include<bits/stdc++.h>
#define N 110000
#define MOD 1000000007
using namespace std;
int c,T,n,k,dp[N][3],mark[N],fac[N];
vector<pair<int,int>>v[N];
int qpow(int a,int b){
    int ans=1;
    while(b){
        if(b&1)ans=1ll*ans*a%MOD;
        a=1ll*a*a%MOD;
        b>>=1;
    }
    return ans;
}
void dfs(int x,int fid){
    if(v[x].size()==1){
        dp[x][0]=1;
        dp[x][1]=dp[x][2]=mark[fid];
        return;
    }
    int prod=1;
    for(auto [to,id]:v[x]){
        if(id==fid)continue;
        dfs(to,id);
        prod=1ll*prod*dp[to][0]%MOD;
    }
    dp[x][0]=1ll*prod*fac[v[x].size()-1]%MOD;
    if(mark[fid]){
        dp[x][1]=dp[x][2]=dp[x][0];
        prod=1;
        int sum=0;
        for(auto [to,id]:v[x]){
            if(id==fid)continue;
            sum=1ll*sum*dp[to][0]%MOD;
            sum=(sum+1ll*prod*fac[v[x].size()-2]%MOD*(dp[to][1]-dp[to][2]+MOD))%MOD;
            // cerr<<"sum="<<sum<<endl;
            prod=1ll*prod*dp[to][0]%MOD;
        }
        // cerr<<"sum="<<sum<<endl;
        dp[x][1]=(dp[x][1]+sum)%MOD;
    }
    else{
        prod=1;
        int sum1=0,sum2=0;
        for(auto [to,id]:v[x]){
            if(id==fid)continue;
            sum1=1ll*sum1*dp[to][0]%MOD;
            sum2=1ll*sum2*dp[to][0]%MOD;
            sum1=(sum1+1ll*prod*fac[v[x].size()-2]%MOD*dp[to][1])%MOD;
            sum2=(sum2+1ll*prod*fac[v[x].size()-2]%MOD*dp[to][2])%MOD;
            prod=1ll*prod*dp[to][0]%MOD;
        }
        dp[x][1]=(dp[x][1]+sum1)%MOD;
        dp[x][2]=(dp[x][2]+sum2)%MOD;
    }
    // for(auto [to1,id1]:v[x])
    // for(auto [to2,id2]:v[x]){
    //     if(id1==fid||id2==fid)continue;
    //     if(to1 < to2){
    //         int tmp = 1ll*prod*qpow(dp[to1][0],MOD-2)%MOD*qpow(dp[to2][0],MOD-2)%MOD;
    //         dp[x][1]=(dp[x][1]+1ll*tmp*dp[to1][1]%MOD*dp[to2][0]%MOD)%MOD;
    //         dp[x][1]=(dp[x][1]+1ll*tmp*dp[to1][0]%MOD*dp[to2][1]%MOD*)%MOD;
    //         dp[x][1]=(dp[x][1]-1ll*tmp*dp[to1][2]%MOD*dp[to2][2]%MOD%MOD+MOD)%MOD;
    //     }
    // }
    prod=1;
    int sum=0,prod0=0,prod1=0,prod2=0,prod3=0;
    for(auto [to,id]:v[x]){
        if(id==fid)continue;
        sum=1ll*sum*dp[to][0]%MOD;
        sum=(sum+1ll*prod1*dp[to][0])%MOD;
        sum=(sum+1ll*prod0*dp[to][1])%MOD;
        sum=(sum-1ll*prod2*dp[to][2]%MOD+MOD)%MOD;
        prod0=1ll*prod0*dp[to][0]%MOD;
        prod1=1ll*prod1*dp[to][0]%MOD;
        prod2=1ll*prod2*dp[to][0]%MOD;
        prod0=(1ll*dp[to][0]*prod+prod0)%MOD;
        prod1=(1ll*dp[to][1]*prod+prod1)%MOD;
        prod2=(1ll*dp[to][2]*prod+prod2)%MOD;
        prod=1ll*prod*dp[to][0]%MOD;
    }
    dp[x][1]=(1ll*sum*fac[v[x].size()-2]+dp[x][1])%MOD;
    // cerr<<x<<" "<<dp[x][0]<<" "<<dp[x][1]<<endl;
}
int main(){
    freopen("traverse.in","r",stdin);
    freopen("traverse.out","w",stdout);
    cin.tie(0)->sync_with_stdio(0);
    cin>>c>>T;
    while(T--){
        cin>>n>>k;
        fac[0]=1;
        for(int i=1;i<=n;i++)fac[i]=1ll*fac[i-1]*i%MOD;
        memset(dp,0,sizeof(dp));
        memset(mark,0,sizeof(mark));
        for(int i=1;i<=n;i++)v[i].clear();
        for(int i=1;i<n;i++){
            int a,b;
            cin>>a>>b;
            v[a].push_back({b,i});
            v[b].push_back({a,i});
        }
        for(int i=1;i<=k;i++){
            int x;
            cin>>x;
            mark[x]=1;
        }
        for(int i=1;i<=n;i++){
            if(v[i].size()==1){
                for(auto [to,id]:v[i]){
                    dfs(to,id);
                    cout<<dp[to][1]<<'\n';
                }
                break;
            }
        }
    }
    return 0;
}