#include<bits/stdc++.h>
#define N 100000
#define MOD 1000000009
using namespace std;
int c, T, n, k, e;
vector<int> a[N];
int dfs(int k){
	int res=0;
	for(int i=1;i<=a[k].size();i++){
		
	}
}
void solve(){
	long long ans = 0;
	cin>>n >> k;
	for(int i=1;i<n;i++){
		int u,v;
		cin>>u>>v;
		a[u].push_back(v);
	}
	for(int i=1;i<=k;i++){
		cin>>e;
		ans+=dfs(e);
	}
	cout<<ans%MOD<<endl;
}
int main(){
	freopen("traverse.in","r",stdin);
	freopen("traverse.out","w",stdout);
	cin>>c>>T;
	while(T--){
		solve();
	}
	return 0;
}