import java.io.PrintWriter import java.util.* fun PrintWriter.solve() { val scan=FastScanner() val n = scan.nextInt() val k = scan.nextInt() //Making Graph-begin val cnt = IntArray(n + k) val a = Array(n - 1) { 0 } val b = Array(n - 1) { 0 } val c = Array(n - 1) { 0 } for (i in 0 until n - 1) { a[i] = scan.nextInt() - 1 b[i] = scan.nextInt() - 1 c[i] = scan.nextInt() ++cnt[a[i]] ++cnt[b[i]] } val m = Array(k) { 0 } val p = Array(k) { 0 } val x = Array(k) { Array(0) { 0 } } for (i in 0 until k) { m[i] = scan.nextInt() p[i] = scan.nextInt() cnt[n + i] += m[i] x[i] = Array(m[i]) { scan.nextInt() - 1 } for (j in x[i]) ++cnt[j] } val g = Array(n + k) { Array(0) { Pair(0, 0) } } for (i in 0 until n + k) g[i] = Array(cnt[i]) { Pair(0, 0) } for (i in 0 until n - 1) { g[a[i]][--cnt[a[i]]] = Pair(b[i], c[i]) g[b[i]][--cnt[b[i]]] = Pair(a[i], c[i]) } for (i in 0 until k) { for (j in x[i]) { g[n + i][--cnt[n + i]] = Pair(j, 0) g[j][--cnt[j]] = Pair(n + i, p[i]) } } //Making Graph-end //LCA-begin val logn = 16 val dep = Array(n) { -1 } val dis = LongArray(n) { 0 } val nxt = Array(logn + 1) { Array(n) { -1 } } val que = ArrayDeque() dep[0] = 0 que.addLast(0) while (que.isNotEmpty()) { val cur = que.pollFirst() for ((to, cost) in g[cur]) { if (to < n && dep[to] == -1) { dep[to] = dep[cur] + 1 dis[to] = dis[cur] + cost nxt[0][to] = cur que.addLast(to) } } } for (j in 0 until logn) { for (i in 0 until n) { if (nxt[j][i] != -1) { nxt[j + 1][i] = nxt[j][nxt[j][i]] } } } fun lca(x: Int, y: Int): Int { var a = x var b = y if (dep[a] > dep[b]) { a = y b = x } val d = dep[b] - dep[a] for (j in logn downTo 0) { if (d and (1 shl j) > 0) b = nxt[j][b] } if (a == b) return a for (j in logn downTo 0) { if (nxt[j][a] != nxt[j][b]) { a = nxt[j][a] b = nxt[j][b] } } return nxt[0][a] } //LCA-end val q = scan.nextInt() val ans = Array(q) { 0L } val u = Array(q) { 0 } val v = Array(q) { 0 } for (i in 0 until q) { u[i] = scan.nextInt() - 1 v[i] = scan.nextInt() - 1 ans[i] = dis[u[i]] + dis[v[i]] - 2 * dis[lca(u[i], v[i])] } //Dijkstra-begin val dp = Array(n + k) { 0L } val pq = PriorityQueue() for (i in 0 until k) { val yet = Array(n + k) { true } dp[n + i] = 0 yet[n + i] = false pq.add((n + i).toLong()) while (pq.isNotEmpty()) { var d = pq.remove() val cur = (d % (n + k)).toInt() d /= n + k if (dp[cur] < d) continue for ((to, cost) in g[cur]) { if (yet[to]) { yet[to] = false dp[to] = d + cost pq.add((d + cost) * (n + k) + to) } else if (dp[to] > d + cost) { dp[to] = d + cost pq.add((d + cost) * (n + k) + to) } } } for (j in 0 until q) { if (ans[j] > dp[u[j]] + dp[v[j]] + p[i]) { ans[j] = dp[u[j]] + dp[v[j]] + p[i] } } } //Dijkstra-end for (x in ans) println(x) } fun main() { val writer = PrintWriter(System.out, false) writer.solve() writer.flush() } private class FastScanner { private val printable = 33..126 val `in` = System.`in` val buffer = ByteArray(1024) var ptr = 0 var buflen = 0 fun hasNextByte(): Boolean { if (ptr < buflen) { return true } else { ptr = 0 buflen = `in`.read(buffer) if (buflen <= 0) { return false } } return true } fun readByte(): Byte { return if (hasNextByte()) buffer[ptr++] else return -1 } fun hasNext(): Boolean { while (hasNextByte() && buffer[ptr] !in printable) ptr++ return hasNextByte() } fun next(): String { if (!hasNext()) throw NoSuchElementException() val sb = StringBuilder() var b = readByte() while (b in printable) { sb.appendCodePoint(b.toInt()) b = readByte() } return sb.toString() } fun nextLong(): Long { if (!hasNext()) throw NoSuchElementException() var n = 0L var minus = false var b = readByte() if (b == '-'.toByte()) { minus = true b = readByte() } if (b !in '0'.toByte()..'9'.toByte()) { throw NumberFormatException() } while (true) { if (b in '0'.toByte()..'9'.toByte()) { n *= 10 n += b - '0'.toByte() } else if (b == (-1).toByte() || b !in printable) { return if (minus) -n else n } else { throw NumberFormatException() } b = readByte() } } fun nextInt(): Int { val nl = nextLong() if (nl !in Integer.MIN_VALUE..Integer.MAX_VALUE) throw NumberFormatException() return nl.toInt() } fun nextDouble(): Double { return next().toDouble() } }