#include<iostream>
#include<string>
#include<queue>
#include<algorithm>
#include<map>
#include<set>
#include<vector>
#include<math.h>

using namespace std;

#define INF 1000000007
#define LINF (1LL << 62)

typedef long long i64;
typedef pair<i64,i64> P;


i64 T, n, m, to[10101];
vector<int> v[404];
vector<P> G[404];
vector<vector<int>> dist(404, vector<int>(404, INF));
vector<int> route[404][404];
i64 now = 1, next_t = 0;
i64 have[404] = {0};

vector<i64> result;
int finished[404];
i64 o[100][10001];
int Times = 0;

i64 para[2] = {180, 16};

void floyd(){
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= n; j++){
			for(int k = 1; k <= n; k++){
				if(dist[j][k] > dist[j][i] + dist[i][k]){
					//route[j][k] = route[j][i]+route[i][k];
					route[j][k] = route[j][i];
					route[j][k].insert(route[j][k].end(),route[i][k].begin(),route[i][k].end());
					dist[j][k] = dist[j][i] + dist[i][k];
				}
			}
		}
	}
}

P choice_next(int start, i64 t){
	i64 ma = -1, k = -1;
	for(int i = 2; i <= n; i++){
		if(!have[i]) continue;
		if(dist[start][i] >= T-t) continue;
		i64 cnt = 0;
		for(int j = 0; j < route[start][i].size(); j++){
			cnt += have[route[start][i][j]];
		}
		if(ma < cnt * para[0] / (dist[start][i])){
			ma = cnt * para[0] / (dist[start][i]);
			k = i;
		}
	}
	return P(ma, k);
}

int Move(int start, i64 next_t){
	P choice = choice_next(start, next_t);
	i64 ma = choice.first, k = choice.second;
	if(ma >= para[1]){
		int npos = route[start][k][0];
		for(int i = 0; i < dist[now][npos]; i++){
			if(next_t >= T) break;
			//cout << npos << endl;
			o[Times][next_t] = npos;
			next_t++;
		}
		now = npos;
		for(int i = 0; i < have[now]; i++){
			result[Times] += T*T - (next_t - v[now][finished[now]])*(next_t - v[now][finished[now]]);
			finished[now]++;
		}
		have[now] = 0;
		
		next_t = Move(now, next_t);
		
		return next_t;
	}
	for(int i = route[1][now].size()-2; i >= -1; i = route[1][now].size()-2){
		int npos;
		if(i == -1) npos = 1;
		else npos = route[1][now][i];
		for(int j = 0; j < dist[now][npos]; j++){
			if(next_t >= T) break;
			//cout << npos << endl;
			o[Times][next_t] = npos;
			next_t++;
		}
		now = npos;
	}
	return next_t;
}

int main(){
	cin >> n >> m;
	for(int i = 0; i <= n; i++){
		dist[i][i] = 0;
	}
	for(int i = 0; i < m; i++){
		int a,b,c;
		cin >> a >> b >> c;
		G[a].push_back(P(b,c));
		G[b].push_back(P(a,c));
		dist[a][b] = c;
		dist[b][a] = c;
		route[a][b].push_back(b);
		route[b][a].push_back(a);
	}
	cin >> T;
	for(int i = 0; i < T; i++){
		int a,b,c;
		cin >> a;
		if(a){
			cin >> b >> c;
			v[c].push_back(i);
			to[i] = c;
		}
	}
	
	floyd();
	
	for(int para1 = 1; para1 <= 512; para1*=2) for(int para2 = 1; para2 <= 128; para2*=2){
		para[0] = para1; para[1] = para2;
		result.push_back(0);
		for(int i = 0; i <= n; i++){
			have[i] = 0;
		}
		now = 1; next_t = 0;
		for(i64 t = 0; t < T; t++){
			if(now == 1) have[to[t]]++;
			if(next_t > t) continue;
			next_t = Move(1, t);
			if(next_t == t){
				//cout << -1 << endl;
				o[Times][next_t] = -1;
			}
		}
		Times++;
	}
	
	i64 ans_cnt = 0, ans_time = 0;
	for(int i = 0; i < Times; i++){
		if(ans_cnt < result[i]){
			ans_cnt = result[i];
			ans_time = i;
		}
	}
	for(int i = 0; i < T; i++){
		cout << o[ans_time][i] << endl;
	}
	
	return 0;
}