#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>> g;
vector<vector<vector<int>>> path;
vector<int> ans;

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, int & now_time){
    for(int i = 1; i < path[now][dest].size(); i++){
        REP(j, g[path[now][dest][i - 1]][path[now][dest][i]]){
            ans.emplace_back(path[now][dest][i] + 1);
            now_time++;
        }
    }
    now = dest;
    return;
}

signed main(){
    int V,E;
    cin >> V >> E;
    vector<vector<P>> G(V); // 隣接リスト
    g.assign(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);
        g[u][v] = d;
        g[v][u] = d;
    }
    int T;
    cin >> T;
    vector<int> order[T]; // order[i] : 時刻 i に発生する注文
    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));
    vector<vector<int>> dist(V);
    path.assign(V, vector<vector<int>>(0, vector<int>(0)));
    for(int i = 0; i < V; i++){
        dist[i] = Dijkstra(i, G, prev[i], INF); // 全点間最短経路を求める
        path[i] = GetPath(prev[i]); // 経路復元
    }

    auto f = [&dist](int a, int b){ return dist[0][a] > dist[0][b]; };
    priority_queue<int, vector<int>, decltype(f)> que(f); // 持っている商品のうち最も店舗から近いものが上にくる優先度付きキュー
    int now = 0; // now : 現在地
    int pre_time = 0, now_time = 0; // now_time : 現在の時刻
    while(ans.size() <= T){
        if(now_time >= T) break;
        for(int i = pre_time; i <= now_time; i++){
            REP(j,order[i].size()){
                que.emplace(order[i][j]);
            }
        }
        pre_time = now_time + 1;
        if(que.size() > 2 /*根拠なし！w*/){
            while(!que.empty()){
                int dest = que.top(); // 目的地
                que.pop();
                Move(now, dest, now_time);
            }
            Move(now, 0, now_time);
        }else{
            ans.emplace_back(-1);
            now_time++;
        }
    }

    // ここから出力
    REP(i,T){
        if(i >= ans.size()) cout << -1 << endl;
        else cout << ans[i] << endl;
    }
    return 0;
}

Measured memory_bytes: 23296