#include <bits/stdc++.h>
#include "factories.h"
using namespace std;
const int N = 500500;
const long long inf = 1e16;
int sub[N], pos[N];
long long dis[N], mn[N];
pair<int, long long> par[N];
vector<int> modify;
vector<pair<int, int>> adj[N];
void dfs (int u, int p = 0, long long dep = 0){
sub[u] = 1;
dis[u] = dep;
for (auto [v, d] : adj[u]){
if (v != p && pos[v] == 0){
dfs(v, u, dep + 1ll * d);
sub[u] += sub[v];
}
}
}
int centroid (int u, int p, int n){
for (auto [v, d] : adj[u]){
if (v != p && pos[v] == 0 && sub[v] * 2 > n){
return centroid(v, u, n);
}
}
return u;
}
void buildCentroid (int u){
pos[u] = 1;
dfs(u);
vector<int> nxt;
for (auto [v, d] : adj[u]){
if (pos[v] == 0){
int nr = centroid(v, u, sub[v]);
par[nr] = {u, dis[nr]};
nxt.push_back(nr);
}
}
for (int r : nxt){
// cout << u - 1 << " " << r - 1 << "\n";
buildCentroid(r);
}
}
void Init (int n, int a[], int b[], int d[]){
for (int i = 0; i < n - 1; ++i){
++a[i]; ++b[i];
adj[a[i]].push_back({b[i], d[i]});
adj[b[i]].push_back({a[i], d[i]});
}
dfs(1);
int root = centroid(1, 0, n);
buildCentroid(root);
fill(mn, mn + N, inf);
return;
}
void upd (int u, long long dep = 0){
mn[u] = min(mn[u], dep);
modify.push_back(u);
auto [v, d] = par[u];
if (v != 0){
upd(v, dep + 1ll * d);
}
return;
}
long long get (int u, long long dep = 0){
long long ans = dep + mn[u];
auto [v, d] = par[u];
if (v != 0){
ans = min(ans, get(v, dep + d));
}
return ans;
}
long long Query (int S, int X[], int T, int Y[]){
modify.clear();
for (int i = 0; i < S; ++i){
upd(++X[i]);
}
long long ans = inf;
for (int i = 0; i < T; ++i){
ans = min(ans, get(++Y[i]));
}
for (int u : modify){
mn[u] = inf;
}
return ans;
}
int n, q, s, t, a[N], b[N], d[N];
int32_t main (){
ios::sync_with_stdio(false); cin.tie(nullptr);
if (fopen ("test.inp", "r")){
freopen ("test.inp", "r", stdin);
freopen ("test.out", "w", stdout);
}
cin >> n >> q;
for (int i = 0; i < n - 1; ++i){
cin >> a[i] >> b[i] >> d[i];
}
Init(n, a, b, d);
while (q--){
cin >> s >> t;
int x[s], y[t];
for (int i = 0; i < s; ++i){
cin >> x[i];
}
for (int i = 0; i < t; ++i){
cin >> y[i];
}
cout << Query(s, x, t, y) << "\n";
}
}
