#include<iostream>
#include<string>
#include<queue>
#include<algorithm>
#include<map>
#include<set>
#include<vector>
#include<math.h>
#include<time.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<i64> v[404];
vector<P> G[404];
vector<vector<i64>> dist(404, vector<i64>(404, INF));
vector<int> route[404][404];
i64 now = 1, next_t = 0;
i64 have[404] = {0};
i64 quest[10101], quested;

i64 result[300] = {0};
int finished[404];
i64 o[300][10101];
int Times = 0;

i64 para;

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[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 ma = -1, k = -1;
	
	for(int i = 2; i <= n; ++i){
		if(!have[i]) continue;
		if(dist[start][i] >= T-next_t) continue;
		i64 cnt = 0;
		for(int j = 0; j < route[start][i].size(); ++j){
			i64 pos = route[start][i][j];
			i64 Dist = dist[start][pos];
			for(int ii = 0; ii < have[pos]; ++ii){
				i64 POW = (next_t+Dist - v[pos][finished[pos]+ii]);
				cnt += T*T - POW;		//何故か強い
			}
		}
		i64 check = cnt / ((dist[1][i] + dist[start][i])*(dist[1][i] + dist[start][i]));
		if(ma < check){
			ma = check;
			k = i;
		}
	}
	return P(ma, k);
}

void Move(){
	P choice = choice_next(now);
	i64 ma = choice.first, k = choice.second;
	if(ma >= para){
		int npos = route[now][k][0];
		for(int i = 0; i < dist[now][npos]; ++i){
			if(next_t >= T) return;
			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];
		}
		quested += have[now];
		have[now] = 0;
		
		if(now == 1) return;
		Move();
		
		return;
	}
	
	while(!route[now][1].empty()){
		int npos;
		npos = route[now][1][0];
		for(int j = 0; j < dist[now][npos]; ++j){
			if(next_t >= T) return;
			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];
		}
		quested += have[now];
		have[now] = 0;
	}
	return;
}

int main(){
	clock_t start_clock = clock();
	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;
		quest[i+1] = quest[i];
		if(a){
			cin >> b >> c;
			v[c].push_back(i);
			to[i] = c;
			++quest[i+1];
		}
	}
	
	floyd();
	
	for(i64 para1 = 5000; (clock()-start_clock)/CLOCKS_PER_SEC < 28 && para1 < 2000000; para1 = (i64)(1.05 * para1)){
		para = para1;
		for(int i = 0; i <= n; ++i){
			have[i] = 0;
			finished[i] = 0;
		}
		now = 1; next_t = 0;
		for(i64 t = 0; t < T; ++t){
			++have[to[t]];
			if(next_t > t) continue;
			if(to[t] != 0) Move();
			if(next_t <= t){
				o[Times][next_t] = -1;
				next_t = t+1;
			}
		}
		//cout << clock()-start_clock << " " << para << ":" << result[Times] << endl;
		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;
}

Measured memory_bytes: 39296