#include <iostream>
#include <queue>
#include <algorithm>
#include <vector>
#include <math.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;

int V, E, INF = 1e9, d[500][500], d2[500][500];
int Tmax, nxt[500][500];
pair<int, int> order[10010];

ll score_calc(vector<int> output) {
    ll score = 0;
    int from = 1, to = -1, at = 0, id = 0;
    vector<int> dst[500];
    for (int i = 0; i < Tmax; i++) {
        if (order[id].first == i) {
            dst[order[id].second + 1].push_back(i);
            id++;
        }
        if (output[i] != -1) {
            if (to == -1) {
                to = output[i];
                at = 1;
            }
            else {
                if (to == output[i]) {
                    at++;
                    if (at == d2[from - 1][to - 1]) {
                        from = to;
                        to = -1;
                        at = 0;

                        for (int j = 0; j < dst[from].size(); j++) {
                            score += Tmax * Tmax - pow(i - dst[from][j], 2);
                        }
                        dst[from].clear();
                    }
                }
                else {
                    //cout << "out: " << i  << " " << output[i] << " " << from << " " << to << " " << at << " ";
                    //cout << d2[from - 1][to - 1] << " ";
                    return -1;
                }
            }
        }
    }
    return score;
}

void warshall_floyd() {
    for (int i = 0; i < V; i++) {
        for (int j = 0; j < V; j++) nxt[i][j] = j;
    }
    for (int k = 0; k < V; k++) {
        for (int i = 0; i < V; i++) {
            for (int j = 0; j < V; j++) {
                if (d2[i][k] + d2[k][j] < d2[i][j]) {
                    d2[i][j] = min(d2[i][j], d2[i][k] + d2[k][j]);
                    nxt[i][j] = nxt[i][k];
                }
            }
        }
    }        
}

vector<int> shortestPath(int start, int goal) {
    vector<int> path;
    for (int cur = start; cur != goal; cur = nxt[cur][goal]) {
        path.push_back(cur);
    }
    path.push_back(goal);
    return path;
}

int main() {
    
    cin >> V >> E;

    for (int i = 0; i < V; i++) {
        for (int j = 0; j < V; j++) {
            d[i][j] = INF;
        }
    }
    
    for (int i = 0; i < E; i++) {
        int u, v, w;
        cin >> u >> v >> w;
        u--;  v--;
        d[u][v] = w;
        d[v][u] = w;
    }
    
    for (int i = 0; i < V; i++) {
        for (int j = 0; j < V; j++) {
            d2[i][j] = d[i][j];
        }
    }

    warshall_floyd();

    
    cin >> Tmax;
    for (int i = 0; i < Tmax; i++) {
        int Nnew;
        cin >> Nnew;
        if (Nnew == 1) {
            int ID, dst;
            cin >> ID >> dst;
            order[ID - 1] = make_pair(i, dst - 1);
        }
    }

    int id = 0, i = 0;
    vector<int> output;
    while (i < Tmax) {
        if (i < order[id].first) {
            output.push_back(-1);
            i++;
        }
        else {
            int tmp = 0;
            vector<int> route = shortestPath(0, order[id].second);
            for (int j = 0; j < route.size() - 1; j++) {
                for (int k = 0; k < d[route[j]][route[j + 1]]; k++) {
                    output.push_back(route[j + 1] + 1);
                    tmp++;
                }
            }
            route = shortestPath(order[id].second, 0);
            for (int j = 0; j < route.size() - 1; j++) {
                for (int k = 0; k < d[route[j]][route[j + 1]]; k++) {
                    output.push_back(route[j + 1] + 1);
                    tmp++;
                }
            }
            i += tmp;
            id++;
        }
    }

    //cout << "score: " << score_calc(output) << endl;
    for (int i = 0; i < Tmax; i++) cout << output[i] << endl;
    /*for (int i = 0; i < V; i++) {
        for (int j = 0; j < V; j++) {
            if (d[i][j] == INF) cout << -1 << " ";
            else cout << d[i][j] << " ";
        }
        cout << endl;
    }
    //*/
}

Measured memory_bytes: 2816