#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=(ll)1e9+7;
const ll INF=(ll)1e18+10;

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }

int dist[410][410],to[410][410];
queue<int> odlist[100010];
int tmax;
int N,M;
vector<int> nyukatime;

deque<int> nodeorder[410];

const int numepoch=50;

class Order{
public:
    int dst,ot; //目的地と注文時刻 destination ordertime
    int status; //0:未発注 1:注文済 2:入荷済　3:発送済み

    Order(int x,int y){
        dst=y;
        ot=x;
        status=0;
    }

    Order(const Order& src){ //コピーコンストラクタ
        dst=src.dst;
        ot=src.ot;
        status=src.status;
    }
};

vector<Order> od;

vector<int> path(int s, int g){  //s,g間の最短経路を格納
    vector<int> tmp;
    int pos;
    for (pos = s; pos!=g ; pos=to[pos][g]) {
        //cout<<pos<<endl;
        tmp.push_back(pos);
    }
    tmp.push_back(g);
    return tmp;
}

void nyuka(int t){ //入荷処理
    nyukatime.push_back(t);
    for(int i=0;i<od.size();++i){
        if(od[i].ot<=t&&od[i].status<=1) od[i].status=2;
    }
}

void delivered(int node){ //配達完了
    if(nodeorder[node].empty()) return;
    while(od[nodeorder[node].front()].status==2){
        od[nodeorder[node].front()].status=3; //配送済みにする
        //ans[epoch]+=pow((ll)tmax,2ll)-pow((ll)od[nodeorder[node].front()].ot,2ll);
        nodeorder[node].pop_front();
    }
}


int nextdst(int prenode,int t,int& nextorder){
    int fast=MOD,fastno=-1;
    int cnt=0;
    for(int i=0;i<od.size();++i){
        if(od[i].status==1) ++cnt;
    }
    //cout<<"-------------"<<endl;
    for(int i=0;i<od.size();++i){
        if(od[i].status<=1){
            int tmp=max(od[i].ot-t,dist[prenode][0])+dist[0][od[i].dst];
            tmp*=max(0.5-0.005*cnt,0.3);
            //cout<<i<<", a:"<<tmp<<endl;
            if(tmp<fast){
                fast=tmp;
                fastno=0;
                nextorder=i;
            }
        }else if(od[i].status==2){
            int tmp=dist[prenode][od[i].dst]-(t-od[i].ot)*0;
            //cout<<i<<", b:"<<tmp<<endl;
            if(tmp<fast){
                fast=tmp;
                //fastno=i;
                fastno=od[i].dst;
                nextorder=i;
            }
        }
    }
    //cout<<"-------------"<<endl;
    return fastno;
}

/*
int nextdst(int prenode,int t,int& nextorder){
    int fast=MOD,fastno=-1;
    int cnt=0;
    for(int i=0;i<od.size();++i){
        if(od[i].status==2) ++cnt;
    }
    //cout<<"-------------"<<endl;
    if(cnt<10){
        for(int i=0;i<od.size();++i){
            if(od[i].status<=1){
                int tmp=max(od[i].ot-t,dist[prenode][0])+dist[0][od[i].dst];
                //cout<<i<<", a:"<<tmp<<endl;
                if(tmp<fast){
                    fast=tmp;
                    fastno=0;
                    nextorder=i;
                }
            }else if(od[i].status==2){
                int tmp=dist[prenode][od[i].dst];
                //cout<<i<<", b:"<<tmp<<endl;
                if(tmp<fast){
                    fast=tmp;
                    //fastno=i;
                    fastno=od[i].dst;
                    nextorder=i;
                }
            }
        }
    }else{

        for(int i=0;i<od.size();++i){

        }
    }



    //cout<<"-------------"<<endl;
    return fastno;
}
*/



int go(int start,int goal,int starttime){ //到着時の時刻を返す
    vector<int> pathtod(path(start,goal));
    int pos=start,i=1;
    while(pos!=goal&&starttime<tmax){
        if(pos==0) nyuka(starttime);
        int tmp=tmax-starttime;
        for (int j = 0; j < min(dist[pos][pathtod[i]], tmp); ++j) {
            cout<<pathtod[i]+1<<endl;
            ++starttime;
        }
        pos=pathtod[i];
        if(pos==0){
            nyuka(starttime);
        }else{
            delivered(pos);
        }

        /*
        while(!odlist[pos].empty()){ //要らなそう
            od[odlist[pos].front()].status=3;
            odlist[pos].pop();
        }
         */
        ++i;
    }
    return starttime;
}


int main() {
    cin>>N>>M;
    for (int i = 0; i < N; ++i) {
        for (int j = 0; j < N; ++j) {
            to[i][j]=j;
            if(i==j) dist[i][j]=0;
            else dist[i][j]=MOD; //初期化
        }
    }
    int u,v,d;
    for (int i = 0; i < M; ++i) {
        cin>>u>>v>>d; --u; --v;
        dist[u][v]=d;
        dist[v][u]=d;
    }

    //ワーシャルフロイド
    for (int k = 0; k < N; ++k) {
        for (int i = 0; i < N; ++i) {
            for (int j = 0; j < N; ++j) {
                if(chmin(dist[i][j],dist[i][k]+dist[k][j])){
                    to[i][j]=to[i][k];
                }
            }
        }
    }

    cin>>tmax;
    //注文情報を受け取る
    int Ncnt,id,dst;

    for (int i = 0; i < tmax; ++i) {
        cin>>Ncnt;
        if(Ncnt){
            cin>>id>>dst; --dst;
            od.push_back(Order(i,dst));
            nodeorder[dst].push_back(id-1);
        }
    }

    //最速で届けられる場所の探索
    int first=0;
    for(int i=0;i<od.size();++i){
        int drive=dist[0][od[i].dst];
        if(od[i].ot+drive<od[first].ot+dist[0][od[first].dst]){
            first=i;
        }
    }

    for(int i=0;i<=first;++i){
        od[i].status=2; //入荷
        odlist[od[i].dst].push(i);
    }
    /*
    for(int i=0;i<od.size();++i){
        cout<<od[i].status<<" ";
    }
    cout<<endl;
    */
    int prenode=0,dstnode=od[first].dst,nextorder=first;
    //int update=od[first].ot; //最後にノード0に来た時刻
    int t=0;
    while(t<tmax){
        if((prenode==0&&t<od[nextorder].ot)||dstnode==-1) {
            cout<<-1<<endl;
            ++t;
            continue;
        }

        if(prenode==0){
            dstnode=od[nextorder].dst;
        }

        t=go(prenode,dstnode,t);
        if(dstnode>0) od[nextorder].status=3;
        prenode=dstnode;
        dstnode=nextdst(prenode,t,nextorder);
        /*
        cout<<"next order"<<nextorder<<endl;
        for(int i=0;i<od.size();++i){
            cout<<od[i].status<<" ";
        }
        cout<<endl;
        */
    }
    

    return 0;
}


Measured memory_bytes: 70528