import java.util.*; import java.io.*; public class Main { static ArrayList> graph = new ArrayList<>(); static int[] depths; static int[][] parents; static long[] totals; public static void main (String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); String[] first = br.readLine().split(" ", 2); int n = Integer.parseInt(first[0]); int k = Integer.parseInt(first[1]); for (int i = 0; i < n + k; i++) { graph.add(new HashMap<>()); } for (int i = 0; i < n - 1; i++) { String[] line = br.readLine().split(" ", 3); int a = Integer.parseInt(line[0]) - 1; int b = Integer.parseInt(line[1]) - 1; int c = Integer.parseInt(line[2]); graph.get(a).put(b, c); graph.get(b).put(a, c); } depths = new int[n]; parents = new int[18][n]; totals = new long[n]; setDepth(0, 0, 0, 0); for (int i = 1; i < 18; i++) { for (int j = 0; j < n; j++) { parents[i][j] = parents[i - 1][parents[i - 1][j]]; } } int[] prices = new int[k]; for (int i = 0; i < k; i++) { String[] line = br.readLine().split(" ", 2); int m = Integer.parseInt(line[0]); int p = Integer.parseInt(line[1]); prices[i] = p; String[] ports = br.readLine().split(" ", m); for (int j = 0; j < m; j++) { int x = Integer.parseInt(ports[j]) - 1; graph.get(x).put(n + i, p); graph.get(n + i).put(x, 0); } } PriorityQueue queue = new PriorityQueue<>(); long[][] costs = new long[k][n + k]; for (int i = 0; i < k; i++) { Arrays.fill(costs[i], Long.MAX_VALUE); queue.add(new Path(n + i, 0)); while (queue.size() > 0) { Path p = queue.poll(); if (costs[i][p.idx] <= p.value) { continue; } costs[i][p.idx] = p.value; for (int x : graph.get(p.idx).keySet()) { queue.add(new Path(x, p.value + graph.get(p.idx).get(x))); } } } int q = Integer.parseInt(br.readLine()); StringBuilder sb = new StringBuilder(); for (int i = 0; i < q; i++) { String[] line = br.readLine().split(" ", 2); int left = Integer.parseInt(line[0]) - 1; int right = Integer.parseInt(line[1]) - 1; int lca = getLCA(left, right); long ans = totals[left] + totals[right] - totals[lca] * 2; for (int j = 0; j < k; j++) { long tmp = costs[j][left] + costs[j][right] + prices[j]; ans = Math.min(ans, tmp); } sb.append(ans).append("\n"); } System.out.print(sb); } static int getLCA(int left, int right) { if (depths[left] < depths[right]) { return getLCA(right, left); } for (int i = 17; i >= 0; i--) { if (depths[left] - depths[right] >= (1 << i)) { left = parents[i][left]; } } if (left == right) { return left; } for (int i = 17; i >= 0; i--) { if (parents[i][left] != parents[i][right]) { left = parents[i][left]; right = parents[i][right]; } } return parents[0][left]; } static void setDepth(int idx, int p, int d, long c) { depths[idx] = d; parents[0][idx] = p; totals[idx] = c; for (int x : graph.get(idx).keySet()) { if (x == p) { continue; } setDepth(x, idx, d + 1, c + graph.get(idx).get(x)); } } static class Path implements Comparable { int idx; long value; public Path(int idx, long value) { this.idx = idx; this.value = value; } public int compareTo(Path another) { if (value == another.value) { return 0; } else if (value < another.value) { return -1; } else { return 1; } } } }