//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using ll = int64_t;
using ull = uint64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T>>;
const int INF = 0xccccccc;
const ll LINF = 0xcccccccccccccccLL;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}



//head



int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  vector<vector<pair<int, ll>>> G(n+k);
  rep(i, n-1) {
    int a, b, c;
    cin >> a >> b >> c;
    a--; b--;
    G[a].emplace_back(b, c);
    G[b].emplace_back(a, c);
  }
  rep(i, k) {
    int m, p;
    cin >> m >> p;
    rep(j, m) {
      int x;
      cin >> x;
      x--;
      G[x].emplace_back(n+i, p);
      G[n+i].emplace_back(x, 0);
    }
  }
  int q;
  cin >> q;
  while(q--) {
    int u, v;
    cin >> u >> v;
    u--; v--;
    PQG<pair<ll, int>> que;
    que.emplace(0, u);
    vector<ll> dist(n+k, LINF);
    dist[u] = 0;
    while(not que.empty()) {
      auto [d, now] = que.top();
      que.pop();
      if(dist[now] != d) continue;
      for(auto [to, c]:G[now]) {
        if(chmin(dist[to], d+c)) {
          que.emplace(d+c, to);
        }
      }
    }
    cout << dist[v] << '\n';
  }
}