#include<bits/stdc++.h>
//#pragma GCC optimize(3,"Ofast","inline")
//#define int long long
#define i128 __int128
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define ld double
#define PII pair<int,int>
#define INF 0x3f3f3f3f
#define INFLL 0x3f3f3f3f3f3f3f3f
#define chkmax(a,b) a=max(a,b)
#define chkmin(a,b) a=min(a,b)
#define rep(k,l,r) for(int k=l;k<=r;++k)
#define per(k,r,l) for(int k=r;k>=l;--k)
#define cl(f,x) memset(f,x,sizeof(f))
#define pcnt(x) __builtin_popcount(x)
#define lg(x) (31-__builtin_clz(x))
using namespace std;
void file_IO() {
//	system("fc .out .ans");
	freopen(".in","r",stdin);
	freopen(".out","w",stdout);
}
bool M1;
const int N=1e4+5;
int head[N],len;
struct node {
	int to,c,w,nxt;
}; node edge[N<<1];
void add_edge(int u,int v,int c,int w) {
	edge[++len]={v,c,w,head[u]}; head[u]=len;
}
int f[N][N],tmp[N],siz[N],n,m;
int cnt[N];
void dfs(int u,int fa) {
	rep(i,-n,0)
		f[u][n+i+cnt[u]]=0;
	siz[u]=1;
	for(int i=head[u];i;i=edge[i].nxt) {
		int v=edge[i].to,c=edge[i].c,w=edge[i].w;
		if(v!=fa) {
			dfs(v,u);
			rep(i,-n,+n) {
				tmp[n+i]=f[u][n+i];
				f[u][n+i]=INF;
			}
			rep(i,-n,+n) {
				rep(j,-n,+n) {
					if((abs(j)&1)==c)
						chkmin(f[u][n+i+j],tmp[n+i]+f[v][n+j]+abs(j)*w);
				}
			}
			siz[u]+=siz[v];
		}
	}
}
/*
5
3 2
1 2 1 1
2 3 2 1
1 3
4 2
1 2 3 1
2 3 1 0
3 4 4 1
1 2
5 4
1 2 3 0
2 3 1 1
3 4 2 0
4 5 2 1
1 1 1 1
5 2
1 2 2 1
1 3 3 0
1 5 2 1
3 4 1 1
1 2
10 5
1 2 10 1
2 3 3 1
3 4 4 0
4 5 4 1
5 6 2 1
2 7 8 0
2 8 9 1
4 9 1 0
1 10 4 0
10 10 2 1 8
*/
void solve() {
	len=0;
	rep(i,1,n)
		head[i]=cnt[i]=0;
	rep(i,1,n) {
		rep(j,0,n+n)
			f[i][j]=INF;
	}
	scanf("%d%d",&n,&m);
	rep(i,1,n) {
		rep(j,0,n+n)
			f[i][j]=INF;
	}
	rep(i,2,n) {
		int u,v,w,c;
		scanf("%d%d%d%d",&u,&v,&w,&c);
		add_edge(u,v,c,w);
		add_edge(v,u,c,w);
	}
	while(m--) {
		int x;
		scanf("%d",&x);
		++cnt[x];
	}
	dfs(1,0);
	printf("%d\n",f[1][n]>=INF? -1:f[1][n]);
}
bool M2;
signed main() {
	//file_IO();
	int testcase=1;
	scanf("%d",&testcase);
	while(testcase--)
		solve();
	fprintf(stderr,"used time = %ldms\n",1000*clock()/CLOCKS_PER_SEC);
	fprintf(stderr,"used memory = %lldMB\n",(&M2-&M1)/1024/1024);
	return 0;
}