#include <bits/stdc++.h>

using namespace std; 
#define REP(i, n) for (int i = 0; i < (n); i++)
#define VERTEX_MAX 401
#define INF 1000000
typedef long long ll;
typedef pair<int,int> pii;//  t,dst_idx

struct edge {
    int to;
    int cost;
};
struct order {
    int dst;
    int id;
    int issued_time;

    bool operator<(order other) const
    {
        return issued_time < other.issued_time;
    }
};
int d[VERTEX_MAX][VERTEX_MAX]; //d[s][d] -> s,d間の最短距離を持つ(ワーシャルフロイド)
int warshall_next[VERTEX_MAX][VERTEX_MAX]; // warshall_next[i][j] -> i-jの最短路におけるiの次の点
void warshall_floyd(){
    REP(k, VERTEX_MAX) {
        REP(i, VERTEX_MAX) {
            REP(j, VERTEX_MAX) {
                int pre_dij = d[i][j];
                d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
                if (pre_dij != d[i][j]){ // 同じなら少しでも多く経由したい
                    warshall_next[i][j] = warshall_next[i][k];
                }
            }
        }
    }
}

int dst2op(int src, int dst){// 最短でsrcからdstに行くときのsrcの次に経由するノードを返す
    if (src == dst ) return -1;
    return warshall_next[src][dst];
}

bool kaeritai(int nearest, int rest, int before_load, int car_pos) {
    if(before_load == 0) return false;
    if(nearest > d[car_pos][1]*3 || rest * 4 < before_load ) {
        return true;
    }
    return false;
}

ll score(ll t, ll dst, vector<order> v_loads) {
    ll res = 0;
    for (auto x: v_loads) {
        if (x.dst == dst) {
            res += 100000000 - (t - x.issued_time)*(t - x.issued_time);
        }
    }
    return res;
}

vector<vector<edge>> G(VERTEX_MAX);
bool Tlast = false;
int main(int argc, char const *argv[])
{
    cin.tie(0);
   	ios::sync_with_stdio(false);
    vector<order> v_O;// dst, issued_time
    // ワーシャルフロイド法初期化
    REP(i, VERTEX_MAX) {
        REP(j, VERTEX_MAX) {
            d[i][j] = INF;
            if (i == j && i != 0) {
                d[i][j] = 0;
            }
            warshall_next[i][j] = j;
        }
    }
    //handle input
    int num_V, num_E; cin >> num_V >> num_E;
    REP(i, num_E) {
        int tmp_u, tmp_v, tmp_d; cin >> tmp_u >> tmp_v >> tmp_d;
        edge tmp1, tmp2;
        tmp1.to = tmp_u; tmp1.cost = tmp_d;
        tmp2.to = tmp_v; tmp2.cost = tmp_d;
        G[tmp_u].push_back(tmp2);
        G[tmp_v].push_back(tmp1);
        d[tmp_u][tmp_v] = tmp_d;
        d[tmp_v][tmp_u] = tmp_d;
    }
    int T; cin >> T;
    REP(t, T) {
        int num_O; cin >> num_O;
        REP(i, num_O) {
            order tmp; cin >> tmp.id >> tmp.dst;
            tmp.issued_time = t;
            v_O.push_back(tmp);
        }
    }
    //全点対最短経路
    warshall_floyd();
    // handle status
    int car_pos = 1; // vertex_idx
    // orderを時間昇順に
    sort(v_O.begin(),v_O.end());
    //handle steps
    int op = -1;
    auto already_load = v_O.begin();
    vector<order> v_loads;
    int final_goal = -1;
    
    REP(t, T) {
        if (car_pos == 1) { // 店にいる時(たまたま通過しうる)
            order comp_order = {VERTEX_MAX, 0, t};
            auto res = upper_bound(v_O.begin(), v_O.end(), comp_order);
            // 積み込み
            for (auto itr = already_load; itr != res ;itr++){
                order o;
                o.issued_time = itr->issued_time;
                o.dst = itr->dst;
                o.id = itr->id;
                v_loads.push_back(o);
            }
            // どこに行くか判定
            int min_d = INF;
            int min_dst = 1;
            int max_wating = 0;
            int max_dst = 1;
            for (auto o: v_loads) {
                min_d = min(min_d, d[1][o.dst]);
                if (min_d == d[1][o.dst]) min_dst = o.dst;
                max_wating = max(max_wating, t-o.issued_time);
                if (max_wating == t-o.issued_time) max_dst = o.dst;
            }
            final_goal = min_dst;
            if (!Tlast && max_wating > 500) final_goal = max_dst;//(めっちゃ待つ人をいつ回収すべきか？)
            op = dst2op(car_pos ,final_goal);
            already_load = res;
            if (Tlast) {//500s未満、状態数はv_loadsのpermutationあるが深さ優先で時間制限とかで切れる？
                int num_exec = (int)v_loads.size();
                vector<int> visted_path[num_exec];//最後のは未到かも
                int max_score_exec = -1;
                ll max_score = -1;
                int T_spart = t;
                REP(exec,num_exec){
                    vector<order> tmp_loads(v_loads.size());
                    copy(v_loads.begin(),v_loads.end(),tmp_loads.begin());
                    t = T_spart;
                    ll cur_score = 0;
                    car_pos = 1;
                    //とりあえず全部を候補に行ってみる
                    visted_path[exec].push_back(v_loads[exec].dst);
                    final_goal = v_loads[exec].dst;
                    op = dst2op(car_pos,final_goal);
                    t += d[car_pos][op];
                    //それ以降は最近に配る
                    for(;t<T;t += d[car_pos][op]){//頂点につく毎に
                        car_pos = op;
                        cur_score += score(t,car_pos,tmp_loads);
                        tmp_loads.erase(remove_if(tmp_loads.begin(),tmp_loads.end(), [&car_pos](order o) { return o.dst == car_pos; }),tmp_loads.end());
                        if (car_pos == final_goal){
                            int min_d = INF;
                            int min_dst = 1;
                            for (auto o: tmp_loads) {
                                min_d = min(min_d, d[car_pos][o.dst]);
                                if (min_d == d[car_pos][o.dst]) min_dst = o.dst;
                            }
                            final_goal = min_dst;
                            visted_path[exec].push_back(final_goal);
                        }
                        op = dst2op(car_pos,final_goal);
                    }
                    max_score = max(max_score,cur_score);
                    if (max_score == cur_score) max_score_exec = exec;
                }
                car_pos = 1;
                t = T_spart;
                for (auto x: visted_path[max_score_exec]) {
                    if (t==T) return 0;
                    final_goal = x;
                    while(car_pos != final_goal) {
                        op = dst2op(car_pos,final_goal);
                        for(int t_next = t + d[car_pos][op]; t<T && t<t_next ;t++) {
                            cout << op << endl;
                        }
                        t--;
                        car_pos = op;
                        t++;
                        if (t==T) return 0;
                    }
                }
                for (;t<T;t++){
                    cout << -1 << endl;
                }
            }
        }
        else if (car_pos > 0) {// 店以外の頂点にいる時
            // 荷降ろし
            v_loads.erase(remove_if(v_loads.begin(),v_loads.end(), [&car_pos](order o) { return o.dst == car_pos; }),v_loads.end());
            order comp_order = {VERTEX_MAX, 0, t};
            auto res = upper_bound(v_O.begin(), v_O.end(), comp_order);
            int before_put = distance(already_load,res);
            //どこ行くか判定
            if (final_goal == car_pos) {
                //ここを基本的には近いゴールに配達し、帰巣本能が強くなったら帰る感じにする
                int min_d = INF;
                int min_dst = 1;
                for (auto o: v_loads) {
                    min_d = min(min_d, d[car_pos][o.dst]);
                    if (min_d == d[car_pos][o.dst]) min_dst = o.dst;
                }
                final_goal = min_dst;
                if (kaeritai(min_d, (int)v_loads.size(), before_put, car_pos)) final_goal = 1;
                if (!Tlast && T*0.95 < t + d[car_pos][1]) {
                    Tlast = true;
                    final_goal = 1;
                }
                op = dst2op(car_pos,final_goal);
            }
            else {
                op = dst2op(car_pos,final_goal);
            }
        }
        
        if (op == -1) {
            cout << op << endl;
        }
        else { // opの示すノードまで進む
            for(int t_next = t + d[car_pos][op]; t<T && t<t_next ;t++) {
                cout << op << endl;
            }
            t--;
            car_pos = op;
        }
    }
    return 0;
}


Measured memory_bytes: 2432