//Mashiro
#include<bits/stdc++.h>

#define vc vector
#define db double
#define fi first
#define se second
#define ll long long
#define mk make_pair
#define pb push_back
#define RI register int
#define PI pair<int,int>
#define ull unsigned long long
#define err cerr << "   -_-   " << endl
#define debug cerr << " ------------------- " << endl

#define input(x) freopen(#x".in","r",stdin)
#define output(x) freopen(#x".out","w",stdout)

#define NO puts("No")
#define YES puts("Yes")

//#define OccDreamer
//#define int long long

using namespace std;

namespace IO{
	inline int read(){
		int X=0, W=0; char ch=getchar();
		while(!isdigit(ch)) W|=ch=='-', ch=getchar();
		while(isdigit(ch)) X=(X<<1)+(X<<3)+(ch^48), ch=getchar();
		return W?-X:X;
	}
	inline void write(int x){
		if(x<0) x=-x, putchar('-');
		if(x>9) write(x/10);
		putchar(x%10+'0');
	}
	inline void sprint(int x){write(x), putchar(32);}
	inline void eprint(int x){write(x), putchar(10);}
}using namespace IO;

const int MAXN = 5005;
const int mod = 998244353;

int n, m, f[MAXN][MAXN<<1], siz[MAXN], g[MAXN<<1], sz[MAXN];
int head[MAXN], ne[MAXN<<1], to[MAXN<<1], weight[MAXN<<1], ban[MAXN<<1], cnt;

inline void add(int x, int y, int w, int c){++cnt;to[cnt]=y;ne[cnt]=head[x];head[x]=cnt;weight[cnt]=w; ban[cnt]=c;}

inline void dfs(int x, int fa){
	//cerr << "dfs:" << x << ' ' << fa << endl;
	sz[x]=1; f[x][sz[x]-1]=0; int ouf, co, news;
	for(int i=0;i<=siz[x];++i) f[x][i+sz[x]]=0;
	// val range : [0,siz[x]+sz[x]]
	// f[i][j] 表示在 i 这一个点，j>sz[x] 表示向上出去了 j-sz[x] 条，j<=sz[x] 表示上面进来了 sz[x]-j 条 
	for(int i=head[x];i;i=ne[i]){
		if(to[i]==fa) continue; dfs(to[i],x);	
		for(int j=0;j<=sz[x]+siz[x];++j) g[j]=f[x][j], f[x][j]=1e9;
		news=sz[x]+sz[to[i]];
		for(int j=0;j<=sz[x]+siz[x];++j){
			for(int k=0;k<=sz[to[i]]+siz[to[i]];++k){
				if(ban[i]==((k-sz[to[i]])&1)) continue;
				ouf=k-sz[to[i]];
				co=abs(ouf)*weight[i];
				ouf+=j-sz[x];
				f[x][news+ouf]=min(g[j]+f[to[i]][k]+co,f[x][news+ouf]);
			}
		}
		sz[x]+=sz[to[i]]; siz[x]+=siz[to[i]];
	}
	return ;
}

inline void solve(){
	n=read(), m=read(); cnt=0;
	for(int i=1;i<=n;++i) head[i]=0;
	for(int i=1;i<=n;++i) memset(f[i],127/3,sizeof f[i]);
	for(int i=1;i<=n;++i) siz[i]=0;
	for(int i=2;i<=n;++i){
		int x, y, w, c;
		x=read(), y=read(), w=read(), c=read();
		add(x,y,w,!c), add(y,x,w,!c);
	}
	int x;
	for(int i=1;i<=m;++i) x=read(), siz[x]++;
	dfs(1,0); 
	int ans=f[1][n];
	if(ans>n*10) eprint(-1);
	else eprint(ans);
}

signed main(){
	int t=read();
	while(t--) solve();
	return 0;
}