import sys
from random import randint
from copy import deepcopy
from collections import deque
from heapq import heapify, heappop, heappush
 
def salesman(cost, order, wf):
    vo = [0]
    left = set()
    left |= order
    now_id = 0
    while left: #NN
        min_cost = 10000000
        dist = 0
        for key in left:
            if wf[now_id][key] < min_cost:
                min_cost = wf[now_id][key]
                dist = key
        left -= {dist}
        vo.append(dist)
        now_id = dist
    vo.append(0)

    order_num = len(order)
    for _ in range(order_num ** 2):
        a, b = randint(0, order_num), randint(0, order_num)
        if a == b: continue
        a, b = min(a, b), max(a, b)
        d_cost = wf[vo[a]][vo[b]] + wf[vo[a+1]][vo[b+1]]
        d_cost -= wf[vo[a]][vo[a + 1]] + wf[vo[b]][vo[b+1]]
        if d_cost < 0:
            swap = deepcopy(vo[a + 1 : b + 1])
            for i in range(b - a):
                vo[a + 1 + i] = swap[b - a - 1 - i]

    return vo
 
def solve():
    inf = 10000000000
    input = sys.stdin.readline
    
    V, E = map(int, input().split())
    edge = dict()
    wf = dict()
    next_id = dict() #iからjに行くときにiの次に訪れる地点
    for i in range(V):
        edge[i] = dict()
        wf[i] = dict()
        next_id[i] = dict()
        for j in range(V):
            edge[i][j] = (0 if i == j else inf)
            next_id[i][j] = j
            wf[i][j] = (0 if i == j else inf)
 
    for _ in range(E):
        u, v, d = map(int, input().split())
        edge[u - 1][v - 1] = d
        edge[v - 1][u - 1] = d
        wf[u - 1][v - 1] = d
        wf[v - 1][u - 1] = d
 
    #全頂点最短経路と目的の頂点に向かうとき次に行くべき頂点の復元
    for k in range(V): 
        for i in range(V):
            for j in range(V):
                if wf[i][j] > wf[i][k] + wf[k][j]:
                    wf[i][j] = wf[i][k] + wf[k][j]
                    next_id[i][j] = next_id[i][k]
 
    T = int(input())
    order = set()
    stuck_order = set()
 
    command = [None] * T 
    current_id = 0 #現在地
    final_dist = 0 #大目標
    heading = 0 #次に向かう地点
    dist_left = 0 #次に向かう地点までの残り距離
    stuck_cost = [0 for _ in range(V)] 
    cost = [0 for _ in range(V)] 
    driver_hold = 0
    store_hold = 0
    order_id = 0
    visit_order = [] #NN + 2-optで求めた訪問順
 
    for t in range(T):
        N = int(input()) #注文の発生
        if N == 1:
            new_id, dst = map(int, input().split())
            stuck_order |= {dst - 1}
            stuck_cost[dst - 1]+= 1
            store_hold += 1
 
        if dist_left > 0: #移動中の場合そのまま移動を続ける
            dist_left -= 1
            command[t] = heading + 1
        
        else:
            if heading == 0: #店にいるときの処理
                if store_hold == driver_hold == 0: 
                    command[t] = -1
                    continue
                else:
                    for key in stuck_order: 
                        cost[key] += stuck_cost[key]
                        driver_hold += stuck_cost[key]
                        stuck_cost[key] = 0
                    order |= stuck_order
                    stuck_order = set()
                    store_hold = 0
                    visit_order = salesman(cost, order, wf)
                    order_id = 0
                current_id = final_dist = 0
            elif heading in order: #配達中で、荷下ろしをするときの処理
                driver_hold -= cost[heading]
                cost[heading] = 0
                order -= {heading}
 
            current_id = heading #現在地の更新
            if current_id == final_dist: #目的地に到着したときは次の大目標を設定する
                final_dist = visit_order[order_id + 1]
                order_id += 1
                #if current_id > 0:
                    #if store_hold * 1 / (wf[current_id][0]) ** 2 > cost[final_dist] * 10000 / wf[current_id][final_dist]:
                        #final_dist = 0
                        #order_id = 1

            heading = next_id[current_id][final_dist]
            dist_left = edge[current_id][heading] - 1
            command[t] = heading + 1


    for i in range(T): print(command[i])   


    return 0

if __name__ == "__main__":
    solve()


Measured memory_bytes: 36980