#include <iostream>
#include <fstream>
#include <numeric>
#include <stdio.h>
#include <cmath>
#include <queue>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <deque>
#include <bitset>
#include <cstring>
#include <sstream>
 
#define f first
#define s second
#define ll long long
#define ld long double
#define pb push_back
#define all(x) x.begin(),x.end()
#define mp make_pair
#define y0 eto
#define y1 mezhdy
#define y2 nami
#define left extermination
#define right dismemberment
#define O random_shuffle(all(p));
 
using namespace std;
 
typedef pair<int,int> pii;
 
template <class T>void read(vector<T> &a,ll n){T x; a.clear();for(ll i=0;i<n;i++){cin>>x;a.pb(x);}}
template <class T>void write(vector<T> &a){for(T x : a) cout<<x<<" ";cout<<endl;}

const int N=405;

int n,m,Tmax;
int p[N];
vector<pair<int,pii> > orders;


vector<pair<int,pii> > e1;
vector<pair<int,pii> > e2;
map<pii,int> sp;

vector<pii> g1[N];
vector<pii> g2[N];

int d1[N];
int d2[N];

vector<int> path_to[N];
vector<int> path_from[N];
vector<int> cur;
vector<int> cur_r;

double kilk[N];
double k1[N];
double k2[N];

vector<int> ans;
int tm;


void prepare_dsu()
{
    for(int i=0;i<N;i++)
        p[i]=i;
}

int fnd(int u)
{
    if(u==p[u]) return u;
    return p[u]=fnd(p[u]);
}

void un(int a,int b)
{
    int u=fnd(a);
    int v=fnd(b);
    if(rand()&1) swap(u,v);
    if(u!=v)
        p[u]=v;
}

void go1(int u,int p=-1)
{
    if(ans.size()>Tmax) return;
    
    random_shuffle(all(g1[u]));
    
    for(int i=0;i<g1[u].size();i++)
    {
        if(g1[u][i].f==p) continue;
        
        for(int j=0;j<g1[u][i].s;j++)
            ans.pb(g1[u][i].f);
        
        go1(g1[u][i].f,u);
        
        for(int j=0;j<g1[u][i].s;j++)
            ans.pb(u);
        
    }
    
}


void ride1()
{
    go1(1);
}


int main()
{
    ios_base::sync_with_stdio(0);
    //freopen("scripts/test.in", "r", stdin);
    //freopen("scripts/result.out", "w", stdout);
    
    cin>>n>>m;
    for(int i=0;i<m;i++)
    {
        int a,b,c;
        cin>>a>>b>>c;
        e1.pb(mp(c,mp(a,b)));
    }
    
    cin>>Tmax;
    for(int i=0;i<Tmax;i++)
    {
        int Nnew;
        cin>>Nnew;
        while(Nnew--)
        {
            int id,x;
            cin>>id>>x;
            orders.pb(mp(i,mp(id,x)));
        }
    }
    
    prepare_dsu();
    sort(all(e1));
    
    for(int i=0;i<e1.size();i++)
    {
        int a=e1[i].s.f;
        int b=e1[i].s.s;
        int w=e1[i].f;
        sp[mp(a,b)]=w;
        if(fnd(a)!=fnd(b))
        {
            un(a,b);
            g1[a].pb(mp(b,w));
            g1[b].pb(mp(a,w));
            if(a==1 || b==1)
                e2.pb(mp(0,mp(a,b)));
            else
                e2.pb(mp(10000,mp(a,b)));
        }
        else
            e2.pb(mp(w,mp(a,b)));
    }
    
    sort(all(e2));
    prepare_dsu();
    
    for(int i=0;i<e2.size();i++)
    {
        int a=e2[i].s.f;
        int b=e2[i].s.s;
        int w=e2[i].f;
        if(sp.count(mp(a,b)))
            w=sp[mp(a,b)];
        
        if(fnd(a)!=fnd(b))
        {
            un(a,b);
            g2[a].pb(mp(b,w));
            g2[b].pb(mp(a,w));
        }
    }
    
    while(ans.size()<Tmax)
        ride1();
    
    while(ans.size()>Tmax)
        ans.pop_back();
    while(ans.size()<Tmax)
        ans.pb(-1);
    for(int i=0;i<ans.size();i++)
        cout<<ans[i]<<endl;
    
}



Measured memory_bytes: 640