#include <bits/stdc++.h>
using namespace std;
#define REP(i,a) for(int i = 0; i < (a); i++)
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const long long LINF = 1e18;
const long long MOD = 1e9 + 7;
 
vector<vector<int>> edge_length;
vector<vector<int>> order;
vector<vector<int>> dist;
vector<vector<vector<int>>> path;
vector<int> have;
queue<int> order_que;
queue<pair<int, P>> move_que;
bool at_shop;

template <typename T>
vector<T> Dijkstra(int s, vector<vector<pair<int, T>>> & G, vector<int> & prev, const T INF = 1e9){
    using P = pair<T, int>;
    int V = G.size();
    vector<T> dist(V, INF);
    priority_queue<P, vector<P>, greater<P>> que;
    dist[s] = 0;
    que.emplace(0, s);
    while(!que.empty()){
        P p = que.top();
        que.pop();
        int v = p.second;
        if(dist[v] < p.first) continue;
        for(int i = 0; i < G[v].size(); i++){
            int to = G[v][i].first;
            T cost = G[v][i].second;
            if(dist[to] > dist[v] + cost){
                dist[to] = dist[v] + cost;
                prev[to] = v;
                que.emplace(dist[to], to);
            }
        }
    }
    return dist;
}
 
vector<vector<int>> GetPath(vector<int> & prev){
    int V = prev.size();
    vector<vector<int>> path(V);
    for(int i = 0; i < V; i++){
        for(int t = i; t != -1; t = prev[t]){
            path[i].emplace_back(t);
        }
        reverse(path[i].begin(), path[i].end());
    }
    return path;
}
 
void Move(int & now, int dest){
    for(int i = 1; i < path[now][dest].size(); i++){
        int el = edge_length[path[now][dest][i - 1]][path[now][dest][i]];
        REP(j,el){
            if(j == el - 1) move_que.emplace(path[now][dest][i] + 1, P(path[now][dest][i], path[now][dest][i]));
            else move_que.emplace(path[now][dest][i] + 1, P(path[now][dest][i - 1], path[now][dest][i]));
        }
    }
    now = dest;
}

int Nearest(int now){
    int nearest, mn = INF;
    REP(i,have.size()){
        if(have[i] > 0 && dist[now][i] < mn){
            mn = dist[now][i];
            nearest = i;
        }
    }
    return nearest;
}

void Load(){
    while(!order_que.empty()){
        have[order_que.front()]++;
        order_que.pop();
    }
}

void OrderInformation(int now_time){
    REP(i,order[now_time].size()){
        order_que.emplace(order[now_time][i]);
    }
}

void Action(){
    if(move_que.empty()){
        cout << -1 << endl;
        at_shop = true;
    }else{
        cout << move_que.front().first << endl;
        if(move_que.front().second.first == 0 && move_que.front().second.second == 0){
            at_shop = true;
        }else{
            at_shop = false;
        }
        move_que.pop();
    }
}

void AfterAction(){
    string verdict;
    cin >> verdict;
    int n_achieve;
    cin >> n_achieve;
    REP(i,n_achieve){
        int achieve_id;
        cin >> achieve_id;
    }
}
 
signed main(){
    int V,E;
    cin >> V >> E;
    vector<vector<P>> G(V); // 隣接リスト
    edge_length.resize(V, vector<int>(V, INF)); // 隣接行列
    REP(i,E){
        int u,v,d;
        cin >> u >> v >> d;
        u--;
        v--;
        G[u].emplace_back(v, d);
        G[v].emplace_back(u, d);
        edge_length[u][v] = d;
        edge_length[v][u] = d;
    }
    int T;
    cin >> T;
    order.resize(T);
    REP(i,T){
        int n;
        cin >> n;
        REP(j,n){
            int id,dst;
            cin >> id >> dst;
            dst--;
            order[i].emplace_back(dst);
        }
    }

    vector<vector<int>> prev(V, vector<int>(V, -1));
    dist.resize(V);
    path.resize(V);
    for(int i = 0; i < V; i++){
        dist[i] = Dijkstra(i, G, prev[i], INF); // 全点間最短経路を求める
        path[i] = GetPath(prev[i]); // 経路復元
    }

    at_shop = true;
    have.resize(V, 0); // have[i] : 車に積んである頂点 i への商品の数
    for(int now_time = 0; now_time < T; now_time++){
        OrderInformation(now_time);
        if(at_shop){
            Load();
        }
        int cnt = 0;
        REP(i,V){
            if(have[i] > 0){
                cnt++;
            }
        }
        if(cnt > 1 /*根拠なし*/){
            int origin = 0;
            for(int i = 0; i < cnt; i++){
                int dest = Nearest(origin);
                Move(origin, dest);
                have[dest] = 0;//ここがおかしそう
            }
            Move(origin, 0);
        }
        Action();
        //AfterAction();
    }

    return 0;
}

Measured memory_bytes: 23168