#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;

#ifdef CKISEKI
#define safe cerr<<__PRETTY_FUNCTION__<<" line "<<__LINE__<<" safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
template <typename ...T>
void debug_(const char *s, T ...a) {
    cerr << "\e[1;32m(" << s << ") = (";
    int cnt = sizeof...(T);
    (..., (cerr << a << (--cnt ? ", " : ")\e[0m\n")));
}
template <typename I>
void orange_(const char *s, I L, I R) {
    cerr << "\e[1;32m[ " << s << " ] = [ ";
    for (int f = 0; L != R; ++L)
        cerr << (f++ ? ", " : "") << *L;
    cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

const int maxn = 5005;
void chmin(int &x, int v) {
    if (x > v) x = v;
}

vector<tuple<int,int,int>> g[maxn];

const int INF = 1e9;
const int offset = maxn * 2;
int dp[maxn][offset * 2 + 1];
int tmp[offset * 2 + 1];

int hi[maxn], lo[maxn];
int start_cnt[maxn];

void dfs(int i, int f) {
    // at most (+-5000) * 2
    lo[i] = -1;
    hi[i] = start_cnt[i];
    for (int j = lo[i]; j <= hi[i]; j++)
        dp[i][j + offset] = INF;
    dp[i][start_cnt[i] + offset] = 0;

    for (auto [j, l, c]: g[i]) {
        if (j == f) continue;
        dfs(j, i);

        for (int x = lo[i] + lo[j]; x <= hi[i] + hi[j]; x++)
            tmp[x + offset] = INF;

        for (int x = lo[i]; x <= hi[i]; x++) {
            for (int y = lo[j]; y <= hi[j]; y++) {
                if ((y - c) % 2 == 0)
                    chmin(tmp[x + y + offset], dp[i][x + offset] + dp[j][y + offset] + l * abs(y));
            }
        }

        for (int x = lo[i] + lo[j]; x <= hi[i] + hi[j]; x++)
            dp[i][x + offset] = tmp[x + offset];
        lo[i] += lo[j];
        hi[i] += hi[j];
    }

    for (int j = hi[i]; j > lo[i]; j--)
        chmin(dp[i][j - 1 + offset], dp[i][j + offset]);
}


void solve() {
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < n; i++) g[i].clear();
    for (int i = 0; i < n; i++) {
        // dis[i] = parity[i] = pa[i] = must_choose[i] = 0;
        start_cnt[i] = 0;
    }

    for (int i = 1; i < n; i++) {
        int u, v;
        cin >> u >> v;
        --u, --v;
        int l, c;
        cin >> l >> c;
        g[u].emplace_back(v, l, c);
        g[v].emplace_back(u, l, c);
    }
    for (int i = 0; i < m; i++) {
        int s;
        cin >> s;
        --s;
        start_cnt[s] += 1;
    }

    dfs(0, -1);
    if (dp[0][0 + offset] == INF)
        cout << -1 << '\n';
    else
        cout << dp[0][0 + offset] << '\n';
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int T;
    cin >> T;
    while (T--) {
        solve();
    }

    return 0;
}