#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;

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;
}

signed main(){
    int V,E;
    cin >> V >> E;
    vector<vector<P>> G(V); // 隣接リスト
    vector<vector<int>> g(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<int> prev(V, -1);
    vector<int> dist = Dijkstra(0, G, prev, INF); // 店からの最短経路を求める
    vector<vector<int>> path = GetPath(prev); // 経路復元

    vector<int> ans;
    auto f = [&dist](int a, int b){ return dist[a] > dist[b]; };
    priority_queue<int, vector<int>, decltype(f)> que(f); // すでに発生している注文のうち最も近いものが上にくる優先度付きキュー
    int pre = 0, now = 0; // now : 現在の時刻
    while(ans.size() <= T){
        if(now >= T) break;
        for(int i = pre; i <= now; i++){
            REP(j,order[i].size()){
                que.emplace(order[i][j]);
            }
        }
        pre = now + 1;
        if(que.size() > 0){
            int dest = que.top(); // 目的地
            que.pop();
            for(int i = 1; i < path[dest].size(); i++){
                REP(j, g[path[dest][i - 1]][path[dest][i]]){
                    ans.emplace_back(path[dest][i] + 1);
                    now++;
                }
            }
            for(int i = path[dest].size() - 1; i > 0; i--){
                REP(j, g[path[dest][i - 1]][path[dest][i]]){
                    ans.emplace_back(path[dest][i - 1] + 1);
                    now++;
                }
            }
        }else{
            ans.emplace_back(-1);
            now++;
        }
    }

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

Measured memory_bytes: 1536