#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define BIT(X,i) ((X>>i)&1)
#define REP(i,a,b) for(int i = (a); i < (b); ++i)
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define r_all(a) (a).rbegin(), (a).rend()
#define ina(x,n) rep(x_i,n) cin>>x[x_i]
#define outa(x,n) rep(x_i,n) cerr<<x[x_i]<<" \n"[x_i==n-1]

typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef pair<ll, ll> pll;
typedef pair<pll, ll> plll;
typedef vector<pll> vll;
typedef vector<plll> vlll;
typedef priority_queue<pll> pq;

const int MOD = 1e9+7;
const int INF = (1<<30);
const ll INFL = (1L<<61);

const int SKIP = 1;
const int D = 3;

int V, E, T;
int Density;
vl ids, dsts;
vvl edges, connected;
vvl sims;
vvl dists;            // ノードiとノードjの間の最短距離
vvvl path_itoj;       // ノードiとノードjの間の最短パス
vl go;
vl depth;
vl visited_num;
vl ans;

void init();
void output();
int calcPathDist(vl path, vl &res_str, bool w);
vl changeDest(int node, int rest);
vl findPath(int dest);
ll calcOrd(ll dist, ll time);
pq updateOrders(int node, pq orders);
vl solve();
vector<bool> visited;

int main() {
  init();
  ans = solve();
  output();
  // cerr << "visited_num : "; outa(visited_num, visited_num.size());
  return 0;
}


// init
void init() {
  cin >> V >> E;
  Density = D * 4*sqrt(2*V);

  edges.assign(V, vl(V, -1));
  go.assign(V, 0);
  depth.assign(V, INF);
  visited_num.assign(V,0);
  sims.resize(V);
  connected.resize(V);
  dists.assign(V,vl(V,INF));
  path_itoj.assign(V,vvl(V));

  visited.assign(V, false);

  rep(i,E) {
    int u, v, d;
    scanf("%d %d %d", &u, &v, &d); u--; v--;
    edges[u][v] = edges[v][u] = d;
    dists[u][v] = dists[v][u] = d;
    connected[u].pb(v);
    connected[v].pb(u);
    vl p1, p2;
    p1.pb(u); p1.pb(v);
    p2.pb(v); p2.pb(u);
    path_itoj[u][v] = p1;
    path_itoj[v][u] = p2;
  }

  rep(i,V) {
    dists[i][i] = 0;
    path_itoj[i][i] = vl(1, i);
  }
  rep(k,V) {
    rep(i,V) {
      rep(j,V) {
        ll d = dists[i][k] + dists[k][j];
        if (d < dists[i][j]) {
          dists[i][j] = d;
          vl path = (i == k) ? vl(1,i) : path_itoj[i][k];
          if (k == j) {
            path.pb(j);
          } else {
            path.insert(path.end(), path_itoj[k][j].begin()+1, path_itoj[k][j].end());
          }
          path_itoj[i][j] = path;
        }
      }
    }
  }

  rep(i,V) {
    rep(j,V) {
      if (i == j) continue;
      if (dists[i][j] < Density) {
        sims[i].pb(j);
      }
    }
  }

  pq que;
  que.push(mp(0, 0));
  while (!que.empty()) {
    pll x = que.top(); que.pop();
    ll dep = x.ff, node = x.ss;
    if (depth[node] == INF) {
      // cerr << node+1 << ": " << -dep << endl;
      depth[node] = -dep;
    }
    rep(i,V) {
      if (edges[node][i] != -1 && depth[i] == INF) {
        que.push(mp(dep - 1, i));
      }
    }
  }

  cin >> T;
  ids.resize(T);
  dsts.resize(T);
  rep(i,T) {
    int n; scanf("%d", &n);
    if (n == 0) {
      ids[i] = 0; dsts[i] = 0;
    } else {
      scanf("%d %d", &ids[i], &dsts[i]);
      dsts[i]--;
    }
  }
}

// output
void output() {
  int len = ans.size();
  if (len < T) {
    rep(i,len) cout << ans[i] << '\n';
    rep(i,T-len) cout << -1 << '\n';
  } else {
    rep(i,T) cout << ans[i] << '\n';
  }
}

// find a path
vl findPath(int dest) {
  vl path(1, dest);
  int now = dest;
  go[dest] = false;

  while (now != 0) {
    int nnode = 0, mn = INF;
    vl cands;
    for (int next = 0; next < V; next++) {
      if (edges[now][next] != -1 && depth[next] == depth[now] - 1) {
        cands.pb(next);
      }
      if (edges[now][next] != -1 && go[next]) {
        cands.pb(next);
      }
    }
    rep(i,cands.size()) {
      if (visited_num[cands[i]] < mn) {
        mn = visited_num[cands[i]];
        nnode = cands[i];
      }

      // if (go[cands[i]]) { nnode = cands[i]; break; }
    }
    path.pb(nnode);
    go[nnode] = false;
    now = nnode;
    visited_num[nnode]++;
  }

  return path;
}

int calcPathDist(vl path, vl &res_str, bool w) {
  int node = path[0], d = 0;
  REP(i,1,path.size()) {
    int next_node = path[i];
    if (w) rep(j,edges[node][next_node]) res_str.pb(next_node+1);
    d += edges[node][next_node];
    node = next_node;
  }
  return d;
}

vl changeDest(int node, int rest) {
  visited[node] = true;
  int d = 0, nnode;
  vl path;
  vlll cands;
  bool flag = false;
  if (rest == 0) return path;
  REP(next_node,1,V) {
    if (visited[next_node]) continue;
    if (edges[node][next_node] != -1) {
      if (go[next_node]) {
        path.pb(next_node);
        go[next_node] = false;
        nnode = next_node;
        flag = true;
        break;
      }
      if (sims[next_node].empty()) continue;

      int cnt = 0;
      rep(i,sims[next_node].size()) {
        cnt += go[sims[next_node][i]];
      }
      cands.pb(mp(mp(-cnt, -visited_num[next_node]), next_node));
    }
  }
  if (!cands.empty()) {
    if (!flag) {
      sort(all(cands));
      nnode = cands[0].ss;
    }
    path = changeDest(nnode, rest-1);
  }

  path.pb(node);
  go[node] = false;
  return path;
}

ll calcOrd(ll dist, ll time) {
  return pow(dist, 2) * pow(time, 1);
}

pq updateOrders(int node, pq orders) {
  pq n_orders;
  while (!orders.empty()) {
    int dest = orders.top().ss; orders.pop();
    if (go[dest]) {
      n_orders.push(mp(-calcOrd(dists[node][dest], go[dest]), dest));
    }
  }
  return n_orders;
}


// solve
vl solve() {
  int t = 0, dt = 0, now = 0;
  vl res_str;
  priority_queue<pll> orders;

  while (t < T) {
    // 注文待ち
    while (t < SKIP || orders.size() < 5) {
      int dest = dsts[t];
      if (dest != 0) {
        go[dest] = t;
        orders.push(mp(-calcOrd(dists[now][dest], go[dest]), dest));
      }
      res_str.pb(-1);
      t++;
      if (t >= T) break;
    }

    // 積荷を全て下ろすか、店舗に帰るまで移動
    while (!orders.empty() && t < T) {
      int dest = orders.top().ss; orders.pop();
      if (!go[dest]) continue;
      vl path = path_itoj[now][dest];
      REP(i,1,path.size()) {
        rep(j,dists[now][path[i]]) { res_str.pb(path[i]+1); dt++; }
        now = path[i];
        go[now] = 0;
        if (now == 0) break;
      }
      if (now == 0) break;
      int cnt = 0;
      orders = updateOrders(now, orders);
    }

    // 店舗に帰る
    if (now != 0) {
      vl path = path_itoj[now][0];
      REP(i,1,path.size()) {
        rep(j,dists[now][path[i]]) { res_str.pb(path[i]+1); dt++; }
        now = path[i];
        go[now] = 0;
      }
    }

    // 注文の更新
    rep(j,min(dt, T-t)) {
      int dest = dsts[t+j];
      if (dest != 0) {
        orders.push(mp(-dists[0][dest], dest));
        go[dest] = (go[dest]) ? min((int)go[dest], t+j) : t+j;
      }
    }
    t += dt; dt = 0;
    orders = updateOrders(now, orders);
  }

  return res_str;
}

Measured memory_bytes: 43648