#include <bits/stdc++.h>

using namespace std;

constexpr int N = 2e5;

vector<array<int, 2>> nei[N];
int st[N], sz, trs;
int64_t dep[N], byt[N];
vector<array<int, 2>> ev[N], tr[N];
vector<int> from[N];

void build(int v, int64_t cd) {
  dep[sz] = cd;
  st[sz++] = v;
  for (auto [u, c]: nei[v]) if (sz == 1 || st[sz - 2] != u) build(u, cd + c);
  for (auto t: from[v]) {
    int64_t s = 0;
    ev[v].push_back({trs++, 0});
    for (int i = 0; auto [v, l]: tr[t]) {
      if ((s += l) > cd) break;
      ev[st[upper_bound(dep, dep + sz, cd - s) - dep]].push_back({trs - 1, v});
    }
  }
  sz--;
}

struct State: vector<int> { int64_t ans, d; };

void merge(State& a, auto&& b) {
  if (a.size() < b.size()) return merge(b, a), swap(b, a);
  b.d += a.ans;
  a.d += b.ans;
  a.ans += b.ans;
  for (auto& t: b) byt[t] += b.d - a.d, a.push_back(t);
}

State solve(int v, int p) {
  State res{};
  for (auto [u, c]: nei[v]) if (u != p) merge(res, solve(u, v));
  auto ans0 = res.ans;
  for (auto& [t, d]: ev[v]) if (res.ans = max(res.ans, res.d + (byt[t] += d ?: ans0 - res.d)), !d) res.push_back(t);
  return res;
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int n, m; cin >> n >> m;
  for (int i = 1, a, b, c; i < n; ++i) cin >> a >> b >> c, nei[--a].push_back({--b, c}), nei[b].push_back({a, c});
  for (int i = 0, k, s; i < m; ++i) {
    cin >> k >> s;
    from[--s].push_back(i);
    tr[i].resize(k);
    for (auto t: {0, 1}) for (auto& x: tr[i]) cin >> x[t];
  }
  build(0, 0);
  cout << solve(0, 0).ans;
}