def main():
  import sys
  input=sys.stdin.buffer.readline
  
  from heapq import heappush,heappop
  
  from collections import deque
  
  n,k=map(int,input().split())
  g=[[]for _ in range(n+k)]
  for _ in range(n-1):
    a,b,c=map(int,input().split())
    a-=1
    b-=1
    g[a].append((b,c))
    g[b].append((a,c))
  
  logn=17
  dep=[0]*n
  dis=[1<<60]*n
  nxt=[[-1]*n for _ in range(logn)]
  stk=deque([])
  stk.append((0,-1,0,0,0))
  while stk:
    cur,par,cur_dep,cur_dis,idx=stk.pop()
    dep[cur]=cur_dep
    dis[cur]=cur_dis
    nxt[0][cur]=par
    if idx!=len(g[cur]):
      stk.append((cur,par,cur_dep,cur_dis,idx+1))
      if g[cur][idx][0]!=par:
        stk.append((g[cur][idx][0],cur,cur_dep+1,cur_dis+g[cur][idx][1],0))
  
  for j in range(logn-1):
    for i in range(n):
      if nxt[j][i]!=-1:
        nxt[j+1][i]=nxt[j][nxt[j][i]]
  def lca(a,b):
    if dep[a]>dep[b]:
      a,b=b,a
    d=dep[b]-dep[a]
    for j in range(logn):
      if d>>j&1:
        b=nxt[j][b]
    if a==b:
      return a
    for j in range(logn-1,-1,-1):
      if nxt[j][a]!=nxt[j][b]:
        a=nxt[j][a]
        b=nxt[j][b]
    return nxt[0][a]
  
  p=[0]*k
  for i in range(k):
    m,p[i]=map(int,input().split())
    xs=list(map(int,input().split()))
    for x in xs:
      g[n+i].append((x-1,0))
      g[x-1].append((n+i,p[i]))
  
  dp=[[1<<60]*(n+k)for _ in range(k)]
  dik=[]
  for i in range(k):
    dpi=dp[i]
    dpi[n+i]=0
    heappush(dik,(0,n+i))
    while dik:
      d,cur=heappop(dik)
      if dpi[cur]<d:
        continue
      for to,cost in g[cur]:
        if dpi[to]>dpi[cur]+cost:
          dpi[to]=dpi[cur]+cost
          dik.append((dpi[to],to))
  
  q=int(input())
  for _ in range(q):
    u,v=map(int,input().split())
    u-=1
    v-=1
    ans=dis[u]+dis[v]-dis[lca(u,v)]*2
    for i in range(k):
      if ans>dp[i][u]+dp[i][v]+p[i]:
        ans=dp[i][u]+dp[i][v]+p[i]
    print(ans)
main()