// https://atcoder.jp/contests/hokudai-hitachi2019-1/tasks/hokudai_hitachi2019_1_a
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
const int INF = 1e9;

template <typename T> using Matrix = vector<vector<T>>;
template <typename T> void warshall_floyd(Matrix<T> &d, Matrix<T> &n) {
    int V = d.size();
    REP(k, V) REP(i, V) REP(j, V) {
        if (d[i][k] + d[k][j] < d[i][j]) {
            d[i][j] = d[i][k] + d[k][j];
            n[i][j] = n[i][k];
        } else if (k != i && d[i][k] + d[k][j] == d[i][j]) {
            n[i][j] = min(n[i][j], n[i][k]);
        }
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int V, E;
    cin >> V >> E;
    Matrix<int> mat(V, vector<int>(V, INF)), next(V, vector<int>(V));
    REP(i, V) {
        mat[i][i] = 0;
        REP(j, V) next[i][j] = j;
    }

    for (int i = 0; i < E; i++) {
        int x, y, z;
        cin >> x >> y >> z;
        x--, y--;
        mat[x][y] = z;
        mat[y][x] = z;
    }
    warshall_floyd(mat, next);
    int T;
    cin >> T;
    vector<int> ans;
    unordered_set<int> mp, ha;
    queue<int> q;
    int now_pos = 0, count = 0;
    while (T--) {
        int N;
        cin >> N;
        while (N--) {
            int id, dst;
            cin >> id >> dst;
            dst--;
            mp.insert(dst);
        }
        // 開始位置なら荷物を乗せる
        if (now_pos == 0) {
            for (auto &x : mp) {
                ha.insert(x);
            }
            mp.clear();
        }
        if (count == 0) {
            if (!q.empty()) {
                int next_pos = q.front();
                q.pop();
                ans.emplace_back(next_pos);
                count = mat[now_pos][next_pos] - 1;
                now_pos = next_pos;
            } else {
                int next_pos = 0, next_dist = INF;
                for (auto &x : ha) {
                    if (next_dist > mat[now_pos][x]) {
                        next_dist = mat[now_pos][x];
                        next_pos = x;
                    }
                }
                // 時間内に往復できないか、持っている数より店舗の方が4倍多ければ戻る
                if (next_dist * 2 > T || mp.size() > ha.size() * 4) {
                    next_pos = 0;
                } else {
                    // 荷物を降ろしたことにする
                    ha.erase(next_pos);
                }
                if (next_pos == now_pos) {
                    // 初期位置なら待機
                    ans.emplace_back(-2);
                } else {
                    for (int cur = next[now_pos][next_pos]; cur != next_pos;
                         cur = next[cur][next_pos]) {
                        q.push(cur);
                    }
                    q.push(next_pos);
                    next_pos = q.front();
                    q.pop();
                    ans.emplace_back(next_pos);
                    count = mat[now_pos][next_pos] - 1;
                    now_pos = next_pos;
                }
            }
        } else {
            // 直前と同じ方向へ動く
            ans.emplace_back(ans.back());
            count--;
        }
    }
    for (auto &x : ans) {
        cout << x + 1 << "\n";
    }

    return 0;
}


Measured memory_bytes: 1664