#include <algorithm>
#include <chrono>
#include <iostream>
#include <memory>
#include <random>
#include <vector>
#include <cassert>
#include <cstdint>
#include <unordered_set>
using namespace std;

using int64 = int64_t;
using Clock = chrono::steady_clock;
using Ms = chrono::milliseconds;

struct Edge {
  int u;
  int v;
  int dist;
};

struct Order {
  int t;
  int dest;
};

struct Graph {
  Graph();

  // Given in input
  int V;
  vector<Edge> edges;

  // Computable
  vector<vector<int>> neighbors;
  vector<vector<int>> distance;
  vector<vector<int>> distance_to;
};

struct Problem {
  Problem(const Graph& g);

  // Given in input
  const Graph& graph;
  int64 t_max;
  vector<Order> orders;
};

class Solver {
  class State {
  public:
    State(const Problem& p) : problem_(p) {}

    bool moveTo(int p);
    void output() const;
    void updateOrder();

    int position() const { return position_; }
    int time() const { return answer_.size(); }
    const vector<int>& orders() const { return orders_; }

  private:
    const Problem& problem_;
    int position_ = -1;
    int64 score_ = 0;
    vector<int> orders_;
    int order_from_ = 0;
    vector<int> answer_;
  };

 public:
  explicit Solver(const Problem& p) : problem(p) {}

  void solve();
  void output() const;

 private:
  const Problem& problem;
  unique_ptr<State> answer;
};

Graph::Graph() {
  cin >> V;
  int E;
  cin >> E;

  neighbors.resize(V);
  distance.resize(V, vector<int>(V, -1));
  distance_to.resize(V, vector<int>(V, -1));

  for (int i = 0; i < V; ++i) {
    distance[i][i] = 0;
    distance_to[i][i] = -1;
  }
  for (int i = 0; i < E; ++i) {
    int u, v, d;
    cin >> u >> v >> d;
    --u;
    --v;
    edges.emplace_back(Edge{u, v, d});
    neighbors[u].push_back(v);
    neighbors[v].push_back(u);
    distance[u][v] = d;
    distance[v][u] = d;
    distance_to[u][v] = v;
    distance_to[v][u] = u;
  }

  // WF
  for (int k = 0; k < V; ++k) {
    for (int i = 0; i < V; ++i) {
      int ik = distance[i][k];
      if (ik < 0)
        continue;
      for (int j = 0; j < V; ++j) {
        int kj = distance[k][j];
        if (kj < 0)
          continue;
        int ij = distance[i][j];
        if (ij < 0 || ij > ik + kj) {
          distance[i][j] = ik + kj;
          distance_to[i][j] = distance_to[i][k];
        }
      }
    }
  }
}

Problem::Problem(const Graph& g) : graph(g) {
  cin >> t_max;
  for (int t = 0; t < t_max; ++t) {
    int N;
    cin >> N;
    for (int i = 0; i < N; ++i) {
      int id, dest;
      cin >> id >> dest;
      orders.emplace_back(Order{t, dest - 1});
    }
  }
}

void Solver::solve() {
  mt19937 prg;
  unique_ptr<State> state(new State(problem));
  const vector<vector<int>>& dist = problem.graph.distance;
  int next = 0;
  while (state->moveTo(next)) {
    state->updateOrder();
    // Choose the closest destination, if have orders.
    // otherwise, back to 0
    int pos = state->position();
    next = 0;
    if (state->orders().size() == 0)
      continue;

    unordered_set<int> id_set;
    for (int id : state->orders()) {
      id_set.insert(problem.orders[id].dest);
    }
    vector<int> dests(id_set.begin(), id_set.end());
    double shortest = 0;
    dests.insert(dests.begin(), 0);
    for (int i = 0; i < dests.size() - 1; ++i) {
      int j = i + 1;
      int d = dist[dests[i]][dests[j]];
      for (int k = j + 1; k < dests.size(); ++k) {
        int dd = dist[dests[i]][dests[k]];
        if (dd < d) {
          d = dd;
          j = k;
        }
      }
      if (j != i + 1)
        swap(dests[i + 1], dests[j]);
      shortest += d;
    }
    shortest += dist[dests.back()][0];
    dests.push_back(0);

    auto time_limit = Clock::now() + Ms(200);
    while (Clock::now() < time_limit) {
      int i = prg() % (dests.size() - 2) + 1;
      int j = prg() % (dests.size() - 2) + 1;
      if (i == j)
        continue;
      if (i > j)
        swap(i, j);
      int diff = (dist[dests[i - 1]][dests[j]] + dist[dests[i]][dests[j + 1]])
        - (dist[dests[i - 1]][dests[i]] + dist[dests[j]][dests[j + 1]]);
      if (i + 1 < j) {
        diff += (dist[dests[j]][dests[i + 1]] + dist[dests[j - 1]][dests[i]])
          - (dist[dests[i]][dests[i + 1]] + dist[dests[j - 1]][dests[j]]);
      }
      if (diff < 0) {
        swap(dests[i], dests[j]);
        shortest += diff;
      }
    }

    for (int d : dests) {
      if (!state->moveTo(d))
        break;
      state->updateOrder();
    }
  }
  answer = move(state);
}

void Solver::output() const {
  answer->output();
}

bool Solver::State::moveTo(int dest) {
  if (time() >= problem_.t_max)
    return false;

  int& from = position_;
  if (from < 0) {
    position_ = dest;
    return true;
  }
  if (from == dest) {
    answer_.push_back(-1);
    return true;
  }

  // Assume no orders on the way.
  while (time() < problem_.t_max && position() != dest) {
    int next = problem_.graph.distance_to[from][dest];
    int d = problem_.graph.distance[from][next];
    for (int i = 0; i < d && time() < problem_.t_max; ++i) {
      answer_.push_back(next + 1);
    }
    from = next;
  }
  return time() < problem_.t_max;
}

void Solver::State::updateOrder() {
  if (time() >= problem_.t_max)
    return;

  int p = position();
  const vector<Order>& g_orders = problem_.orders;
  if (p == 0) {
    // Check order
    while (order_from_ < static_cast<int>(g_orders.size()) &&
           g_orders[order_from_].t < time()) {
      orders_.push_back(order_from_++);
    }
  } else {
    // Deliver
    for (int i = orders_.size() - 1; i >= 0; --i) {
      const Order& order = g_orders[orders_[i]];
      if (order.dest == position()) {
        int64 dt = time() - order.t;
        score_ += problem_.t_max * problem_.t_max -  dt * dt;
        orders_.erase(orders_.begin() + i);
      }
    }
  }
}

void Solver::State::output() const {
  for (int out : answer_) {
    cout << out << "\n";
  }
}

int main() {
  unique_ptr<Graph> graph(new Graph);
  unique_ptr<Problem> problem(new Problem(*graph));
  unique_ptr<Solver> solver(new Solver(*problem));

  solver->solve();
  solver->output();

  return 0;
}


Measured memory_bytes: 1920