import sys

input = sys.stdin.buffer.readline

infi = 1 << 60

from heapq import heappop, heappush

n, k = map(int, input().split())

graph = [[] for _ in range(n + 2 * k)]
for _ in range(n - 1):
    a, b, c = map(int, input().split())
    a, b = a - 1, b - 1
    graph[a].append((b, c))
    graph[b].append((a, c))


for i in range(k):
    m, p = map(int, input().split())
    X = list(map(int, input().split()))
    vin = n + 2 * i
    vout = n + 2 * i + 1
    for x in X:
        x -= 1
        graph[x].append((vin, 0))
        graph[vout].append((x, 0))
    graph[vin].append((vout, p))


def dijkstra(start, graph, goal):
    infi = 1 << 60
    mask = 1 << 18
    pq = []
    dist = [infi] * (n + 2 * k)
    # dist[start]=0
    heappush(pq, 0 * mask + start)
    while pq:
        temp = heappop(pq)
        d, v = temp // mask, temp & (mask - 1)
        if dist[v] < d:
            continue
        dist[v] = d
        if v == goal:
            return dist[v]
        for u, delta in graph[v]:
            nd = d + delta
            # print("u", u, "nd", nd)
            if dist[u] > nd:
                heappush(pq, nd * mask + u)
    return dist


q = int(input())
for _ in range(q):
    u, v = map(int, input().split())
    u, v = u - 1, v - 1
    print(dijkstra(u, graph, v))