import java.io.*; import java.util.*; public class Main { static ArrayList> graph = new ArrayList<>(); static int[] depth; static int[][] parents; static long[] costs; public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); int k = sc.nextInt(); for (int i = 0; i < n; i++) { graph.add(new HashMap<>()); } for (int i = 0; i < n - 1; i++) { int a = sc.nextInt() - 1; int b = sc.nextInt() - 1; int c = sc.nextInt(); graph.get(a).put(b, c); graph.get(b).put(a, c); } depth = new int[n]; parents = new int[17][n]; costs = new long[n]; setDepth(0, 0, 0, 0); for (int i = 1; i < 17; 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++) { int m = sc.nextInt(); prices[i] = sc.nextInt(); graph.add(new HashMap<>()); for (int j = 0; j < m; j++) { int x = sc.nextInt() - 1; graph.get(x).put(n + i, 0); graph.get(n + i).put(x, prices[i]); } } long[][] flights = new long[k][n + k]; PriorityQueue queue = new PriorityQueue<>(); for (int i = 0; i < k; i++) { Arrays.fill(flights[i], Long.MAX_VALUE); queue.add(new Path(n + i, 0)); while (queue.size() > 0) { Path p = queue.poll(); if (flights[i][p.idx] <= p.value) { continue; } flights[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 = sc.nextInt(); StringBuilder sb = new StringBuilder(); for (int i = 0; i < q; i++) { int left = sc.nextInt() - 1; int right = sc.nextInt() - 1; int lca = getLCA(left, right); long ans = costs[left] + costs[right] - costs[lca] * 2; for (int j = 0; j < k; j++) { ans = Math.min(ans, flights[j][left] + flights[j][right] - prices[j]); } sb.append(ans).append("\n"); } System.out.print(sb); } static int getLCA(int a, int b) { if (depth[a] < depth[b]) { return getLCA(b, a); } for (int i = 16; i >= 0 && depth[a] > depth[b]; i--) { if (depth[a] - depth[b] >= (1 << i)) { a = parents[i][a]; } } if (a == b) { return a; } for (int i = 16; i >= 0; i--) { if (parents[i][a] != parents[i][b]) { a = parents[i][a]; b = parents[i][b]; } } return parents[0][a]; } static void setDepth(int idx, int p, int d, long c) { parents[0][idx] = p; depth[idx] = d; costs[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; } } } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public double nextDouble() throws Exception { return Double.parseDouble(next()); } public String next() throws Exception { if (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }