/**
 * Libraries
 */
#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
#include <string>
#include <queue>
#include <iomanip>
#include <set>
#include <unordered_map>

#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

using namespace std;
using lli = long long int;

const int INF = 1000000007;
const int FULL_SEARCH_NUM = 10;
const int MANY_WAITING_ORDERS = 2000;

struct order {
    int id, dstV;
    int time;
    bool operator<(const order x) const {
        return this->dstV < x.dstV;
    }
};

int dist[400][400];
int nextPath[400][400]; // 経路復元用

int T;

vector<order> orderList; // 順序は保証できないかも
vector<order> waitingList;
queue<int> distQ;

lli calcScore(int t, int car, const order& o) {
    lli deliveredTime = dist[car][o.dstV] + t;
    lli waitingTime = deliveredTime - o.time;
    return T * T - waitingTime * waitingTime;
}

int getNextDst(int t, int car) {
    if (!distQ.empty()) {
        int next = distQ.front();
        if (car == next) {
            distQ.pop();
            return getNextDst(t, car);
        }
        return next;
    }

    int orderNum = orderList.size();
    if (orderNum == 0) {
        return 0;
    }
    // orderNumが大きければ、FULL_SEARCH_NUMの数だけ選んで巡回セール
    int olistSize = min(FULL_SEARCH_NUM, orderNum);
    vector<order> olist(olistSize);
    sort(orderList.begin(), orderList.end(), [=](const order& x, const order& y) {
                return dist[car][x.dstV] < dist[car][y.dstV];
            });
    copy(orderList.begin(), orderList.begin() + olistSize, olist.begin());

    sort(olist.begin(), olist.end());
    lli maxScore = -1 * INF;

    order *nearWO = NULL;
    if (t < T * 95 / 100 && waitingList.size() > MANY_WAITING_ORDERS) {
        nearWO = &waitingList[0];
        for (order o: waitingList) {
            if (dist[0][o.dstV] < dist[0][nearWO->dstV]) {
                nearWO = &o;
            }
        }
    }
    do {
        int now = car;
        int st = t;
        lli score = 0l;
        int breakOrderId = -1;
        for (order o: olist) {
            lli tmpScore = calcScore(st, now, o);
            if (nearWO != NULL) {
                lli newScore = calcScore(st + dist[now][0], 0, *nearWO);
                if (newScore > tmpScore) {
                    score += newScore;
                    breakOrderId = o.id;
                    break;
                }
            }
            score += tmpScore;
            st += dist[now][o.dstV];
            now = o.dstV;
        }
        // cout << "score...: " << score << "maxScore..." << maxScore << endl;
        if (maxScore < score) {
            maxScore = score;
            while (!distQ.empty()) distQ.pop();
            for (order o: olist) {
                if (breakOrderId != -1 && o.id == breakOrderId) break;
                distQ.push(o.dstV);
            }
        }
    } while (next_permutation(olist.begin(), olist.end()));
    if (distQ.empty()) return 0;
    else return distQ.front();
}

signed main() {
    int V, E; cin >> V >> E;
    for (int i = 0; i < V; i++) {
        for (int j = 0; j < V; j++) {
            dist[i][j] = i == j ? 0 : INF;
            nextPath[i][j] = j;
        }
    }
    for (int i = 0; i < E; i++) {
        int u, v, d; cin >> u >> v >> d; u--; v--;
        dist[u][v] = d;
        dist[v][u] = d;
    }
    for (int k = 0; k < V; k++) {
        for (int i = 0; i < V; i++) {
            for (int j = 0; j < V; j++) {
                if (dist[i][j] > dist[i][k] + dist[k][j]) {
                    dist[i][j] = dist[i][k] + dist[k][j];
                    nextPath[i][j] = nextPath[i][k];
                }
            }
        }
    }
    vector<int> f(V);
    for (int i = 0; i < V; i++) {
        cin >> f[i];
    }

    cin >> T;
    int car = 0;
    int skipTo = 0;
    int dstV = 0, gotoV = 0;
    // vector<int> cargoInStore(T, -1);
    // vector<int> cargoOnCar;
    for (int t = 0; t < T; t++) {
        // cout << "time: " << t << endl;
        int N; cin >> N;
        vector<order> orders(N);
        for (order o: orders) {
            cin >> o.id >> o.dstV; o.dstV--; o.time = t;
            waitingList.push_back(o);
        }
        int Nput; cin >> Nput;
        for (int i = 0; i < Nput; i++) {
            int put_id;
            cin >> put_id;
        }

        // 辺上を移動する
        // cout << "move on edge" << endl;
        if (t < skipTo) {
            cout << gotoV + 1 << endl; // move w
            string verdict; cin >> verdict;
            int Nachieve; cin >> Nachieve;
            for (int i = 0; i < Nachieve; i++) {
                int a; cin >> a;
            }
            continue;
        } else if (skipTo == t) {
            skipTo = -1;
            car = gotoV;
        }

        // 積荷回収
        // cout << "salvage" << endl;
        if (car == 0) {
            for (order o: waitingList) {
                orderList.push_back(o);
            }
            waitingList.clear();
        } else if (car == dstV) {
            auto result = remove_if(orderList.begin(), orderList.end(),
                    [=](order o) { return o.dstV == car; });
            orderList.erase(result, orderList.end());
        }

        // 目的地更新
        // cout << "arrive[having orders: " << orderList.size() << "]" << endl;
        dstV = getNextDst(t, car);

        // 短期目的地更新
        // cout << "get destination(" << dstV << ")" << endl;
        gotoV = nextPath[car][dstV];
        skipTo = t + dist[car][gotoV];

        // 意思決定
        // cout << "detect command" << endl;
        if (gotoV == car) {
            cout << -1 << endl; // stay
        } else {
            cout << gotoV + 1 << endl; // move w
        }
        string verdict; cin >> verdict;
        int Nachieve; cin >> Nachieve;
        for (int i = 0; i < Nachieve; i++) {
            int a; cin >> a;
        }
    }
    return 0;
}


Measured memory_bytes: 2644