#ifndef MAIHEADER_H_
#define MAIHEADER_H_

#pragma GCC optimize("O3")
#include "bits/stdc++.h"

using namespace std;
using ll = long long int;

#define debugos cout
#define debug(v)                       \
  {                                    \
    printf("L%d %s > ", __LINE__, #v); \
    debugos << (v) << endl;            \
  }
#define debugv(v)                      \
  {                                    \
    printf("L%d %s > ", __LINE__, #v); \
    for (auto e : (v)) {               \
      debugos << e << " ";             \
    }                                  \
    debugos << endl;                   \
  }
#define debuga(m, w)                   \
  {                                    \
    printf("L%d %s > ", __LINE__, #m); \
    for (int x = 0; x < (w); x++) {    \
      debugos << (m)[x] << " ";        \
    }                                  \
    debugos << endl;                   \
  }
#define debugaa(m, h, w)                \
  {                                     \
    printf("L%d %s >\n", __LINE__, #m); \
    for (int y = 0; y < (h); y++) {     \
      for (int x = 0; x < (w); x++) {   \
        debugos << (m)[y][x] << " ";    \
      }                                 \
      debugos << endl;                  \
    }                                   \
  }
#define all(v) (v).begin(), (v).end()
#define repeat(cnt, l) for (auto cnt = remove_reference<decltype(l)>::type(); (cnt) < (l); ++(cnt))
#define rrepeat(cnt, l) for (auto cnt = (l)-1; 0 <= (cnt); --(cnt))
#define iterate(cnt, b, e) for (auto cnt = (b); (cnt) != (e); ++(cnt))
#define diterate(cnt, b, e) for (auto cnt = (b); (cnt) != (e); --(cnt))
const ll MD = 1000000007ll;
const long double PI = 3.1415926535897932384626433832795L;
inline void _assert_call(bool assertion, const char* note, function<void()> f) {
  if (!assertion) {
    cerr << "assertion fault: " << note << endl;
    f();
    abort();
  }
}
#define assert_call(a, f) _assert_call(a, #a, f)
template <typename T1, typename T2>
inline ostream& operator<<(ostream& o, const pair<T1, T2> p) {
  o << '(' << p.first << ':' << p.second << ')';
  return o;
}
template <typename Vec>
inline ostream& _ostream_vecprint(ostream& os, const Vec& a) {
  os << '[';
  for (const auto& e : a)
    os << ' ' << e << ' ';
  os << ']';
  return os;
}
template <typename T>
inline ostream& operator<<(ostream& o, const vector<T>& v) {
  return _ostream_vecprint(o, v);
}
template <typename T, size_t S>
inline ostream& operator<<(ostream& o, const array<T, S>& v) {
  return _ostream_vecprint(o, v);
}
template <typename T>
inline T& chmax(T& to, const T& val) {
  return to = max(to, val);
}
template <typename T>
inline T& chmin(T& to, const T& val) {
  return to = min(to, val);
}
void bye(string s, int code = 0) {
  cout << s << endl;
  exit(code);
}
mt19937_64 randdev(8901016);
template <typename T,
          typename Random = decltype(randdev),
          typename enable_if<is_integral<T>::value>::type* = nullptr>
inline T rand(T l, T h, Random& rand = randdev) {
  return uniform_int_distribution<T>(l, h)(rand);
}
template <typename T,
          typename Random = decltype(randdev),
          typename enable_if<is_floating_point<T>::value>::type* = nullptr>
inline T rand(T l, T h, Random& rand = randdev) {
  return uniform_real_distribution<T>(l, h)(rand);
}

#if defined(_WIN32) || defined(_WIN64)
#define getc_x _getc_nolock
#define putc_x _putc_nolock
#elif defined(__GNUC__)
#define getc_x getc_unlocked
#define putc_x putc_unlocked
#else
#define getc_x getc
#define putc_x putc
#endif
#define isvisiblechar(c) (0x21 <= (c) && (c) <= 0x7E)
class MaiScanner {
  FILE* fp_;

 public:
  inline MaiScanner(FILE* fp) : fp_(fp) {}
  template <typename T>
  void input_integer(T& var) noexcept {
    var = 0;
    T sign = 1;
    int cc = getc_x(fp_);
    for (; cc < '0' || '9' < cc; cc = getc_x(fp_))
      if (cc == '-')
        sign = -1;
    for (; '0' <= cc && cc <= '9'; cc = getc_x(fp_))
      var = (var << 3) + (var << 1) + cc - '0';
    var = var * sign;
  }
  inline int c() noexcept { return getc_x(fp_); }
  inline MaiScanner& operator>>(int& var) noexcept {
    input_integer<int>(var);
    return *this;
  }
  inline MaiScanner& operator>>(long long& var) noexcept {
    input_integer<long long>(var);
    return *this;
  }
  inline MaiScanner& operator>>(string& var) {
    int cc = getc_x(fp_);
    for (; !isvisiblechar(cc); cc = getc_x(fp_))
      ;
    for (; isvisiblechar(cc); cc = getc_x(fp_))
      var.push_back(cc);
    return *this;
  }
  template <typename IT>
  inline void in(IT begin, IT end) {
    for (auto it = begin; it != end; ++it)
      *this >> *it;
  }
};
class MaiPrinter {
  FILE* fp_;

 public:
  inline MaiPrinter(FILE* fp) : fp_(fp) {}
  template <typename T>
  void output_integer(T var) noexcept {
    if (var == 0) {
      putc_x('0', fp_);
      return;
    }
    if (var < 0)
      putc_x('-', fp_), var = -var;
    char stack[32];
    int stack_p = 0;
    while (var)
      stack[stack_p++] = '0' + (var % 10), var /= 10;
    while (stack_p)
      putc_x(stack[--stack_p], fp_);
  }
  inline MaiPrinter& operator<<(char c) noexcept {
    putc_x(c, fp_);
    return *this;
  }
  inline MaiPrinter& operator<<(int var) noexcept {
    output_integer<int>(var);
    return *this;
  }
  inline MaiPrinter& operator<<(long long var) noexcept {
    output_integer<long long>(var);
    return *this;
  }
  inline MaiPrinter& operator<<(char* str_p) noexcept {
    while (*str_p)
      putc_x(*(str_p++), fp_);
    return *this;
  }
  inline MaiPrinter& operator<<(const string& str) {
    const char* p = str.c_str();
    const char* l = p + str.size();
    while (p < l)
      putc_x(*p++, fp_);
    return *this;
  }
  template <typename IT>
  void join(IT begin, IT end, char sep = ' ') {
    for (bool b = 0; begin != end; ++begin, b = 1)
      b ? *this << sep << *begin : *this << *begin;
  }
};
MaiScanner scanner(stdin);
MaiPrinter printer(stdout);

#endif  
#ifndef CONST_H_
#define CONST_H_

const int TMAX = 10000;

#endif  
#ifndef LIB_H_
#define LIB_H_

template <typename T>
class PriorityQueue {
  vector<T> data_;

 public:
  inline PriorityQueue() {}

  inline bool empty() const noexcept { return data_.empty(); }
  inline int size() const noexcept { return data_.size(); }
  inline void reserve(int s) { data_.reserve(s); }
  inline void clear() { data_.clear(); }
  inline const T& top() const noexcept { return data_.front(); }
  inline void pop() {
    pop_heap(data_.begin(), data_.end());
    data_.pop_back();
  }
  inline void push(const T& val) {
    data_.push_back(val);
    push_heap(data_.begin(), data_.end());
  }
  inline void push(T&& val) {
    data_.push_back(move(val));
    push_heap(data_.begin(), data_.end());
  }
  template <typename... Arg>
  inline void emplace(Arg&&... args) {
    data_.emplace_back(forward<Arg>(args)...);
    push_heap(data_.begin(), data_.end());
  }
};

#endif  
#ifndef CLASSES_H_
#define CLASSES_H_




struct Graph {
  int nV;  
  int nE;  
  struct DiEdge {
    int to;
    int length;
    inline DiEdge(int t, int l) : to(t), length(l) {}
  };
  vector<vector<DiEdge>> vertexTo;
  inline void resize(int _nV, int _nE) {
    nV = _nV;
    nE = _nE;
    vertexTo.resize(nV);
  }
  inline void connect(int a, int b, int len) {
    vertexTo[a].emplace_back(b, len);
    vertexTo[b].emplace_back(a, len);
  }
};



struct Order {
  int orderedTime;
  int destination;

  inline bool operator<(Order o) const noexcept {
    return destination != o.destination ? orderedTime < o.orderedTime : destination < o.destination;
  }
  inline ll score(int deriveredTime) const {
    return ll(TMAX) * TMAX - ll(deriveredTime - orderedTime) * (deriveredTime - orderedTime);
  }
  inline Order(int o, int d) : orderedTime(o), destination(d) {}
};



struct Position {
  int from;
  int to;
  int progress;
  int length;
  inline bool waiting() const noexcept { return from == to; }
  inline int vertex() const noexcept { return waiting() ? from : -1; }
  inline void setDestination(int _to, int _length) {
    to = _to;
    length = _length;
    progress = 0;
  }
  
  inline int succ() {
    if (from != to) {
      if (++progress >= length)
        from = to;
      return to;
    }
    return -2;
  }
  inline Position(int f = 0, int t = 0, int p = 0, int l = 0)
      : from(f), to(t), progress(p), length(l) {}
};



template <typename T>
class Table {
 protected:
  int nV;
  int n2v;
  vector<T> table;

 public:
  inline T& operator()(int i, int j) noexcept {
    return table[(j & ((1 << n2v) - 1)) + i * (1 << n2v)];
  }
  inline T operator()(int i, int j) const noexcept {
    return table[(j & ((1 << n2v) - 1)) + i * (1 << n2v)];
  }

  void resize(int _nV) {
    nV = _nV;
    for (n2v = 0; (1 << n2v) < nV; ++n2v)
      ;
    table.resize((1 << n2v) * nV);
  }
  inline void fill(T v) { std::fill(table.begin(), table.end(), v); }
  inline int size() const noexcept { return nV; }

  inline Table() {}
  inline Table(int _nV) { resize(_nV); }

  void dump(ostream& os) const {
    for (int i = 0; i < nV; ++i) {
      auto t = &table[i * (1 << n2v)];
      for (int j = 0; j < nV; ++j) {
        os << *t << ' ';
        ++t;
      }
      os << endl;
    }
  }
};

























void buildGraphInformations(Table<int>& distanceTable,
                            Table<int>& forwardingTable,
                            const Graph& graph) {
  const int nV = distanceTable.size();

  
  distanceTable.fill(numeric_limits<int>::max() / 4);

  PriorityQueue<tuple<int, int, int>> pq;

  repeat(v, nV) {
    pq.clear();
    
    distanceTable(v, v) = 0;
    forwardingTable(v, v) = -1;
    
    for (auto e : graph.vertexTo[v]) {
      distanceTable(v, e.to) = e.length;
      forwardingTable(v, e.to) = e.to;
      pq.emplace(-e.length, e.to, e.to);
    }
    
    while (!pq.empty()) {
      int d, u, f;
      tie(d, u, f) = pq.top();
      d = -d;
      pq.pop();
      
      for (auto e : graph.vertexTo[u]) {
        auto& dt2 = distanceTable(v, e.to);
        if (d + e.length < dt2) {
          dt2 = d + e.length;
          forwardingTable(v, e.to) = f;
          pq.emplace(-dt2, e.to, f);
        }
      }
    }
  }
}



void updateDestination(Position& pos, int destination, const Table<int>& forwardingTable, const Table<int>& distanceTable) {
  
  if (pos.vertex() == destination)
    return;
  int v = forwardingTable(pos.from, destination);
  
  if (pos.waiting()) {
    int d = distanceTable(pos.from, v);
    pos.setDestination(v, d);
  }
  
  else if (pos.to != v) {
    abort();
  }
}

#endif  
#ifndef IO_H_
#define IO_H_


Graph inputGraph() {
  Graph g;
  int n, m;
  scanner >> n >> m;
  g.resize(n, m);
  g.vertexTo.resize(n);
  repeat(i, m) {
    int a, b, c;
    scanner >> a >> b >> c;
    --a;
    --b;
    g.connect(a, b, c);
  }
  return g;
}

#endif  
#ifndef ALGO_H_
#define ALGO_H_

double _partiallyTSP_eval(const Table<int>& distanceTable,
                          const vector<int>& perm,
                          const int start = 0) {
  int d = 0;
  int v = start;
  for (auto u : perm) {
    d += distanceTable(v, u);
    v = u;
  }
  d += distanceTable(v, start);
  return double(d);
}

vector<int> partiallyTSP(const Table<int>& distanceTable,
                         const vector<int>& vertices,
                         const int start = 0) {
  const int n = vertices.size();
  vector<int> perm = vertices;
  vector<int> carton;

  auto nice = _partiallyTSP_eval(distanceTable, perm, start) / double(perm.size());
  auto best = nice;
  auto best_perm = perm;

  double as_temp = 100.0;

  repeat(loop, 2000) {
    int q = rand(0, 3);
    auto pp = perm;  
    auto cc = carton;
    if (q == 0) {
      if (carton.empty())
        continue;
      
      int i = rand<int>(0, carton.size() - 1);
      int j = rand<int>(0, perm.size());

      
      
      
      
      

      int c = carton[i];
      swap(carton[i], carton.back());
      carton.pop_back();
      perm.insert(perm.begin() + j, c);

    } else if (q == 1) {
      if (perm.size() <= 1)
        continue;
      
      int i = rand<int>(0, perm.size() - 1);

      int v = perm[i];
      int vp = i == 0 ? start : perm[i - 1];
      int vn = i == perm.size() - 1 ? start : perm[i + 1];
      
      
      

      carton.push_back(perm[i]);
      perm.erase(perm.begin() + i);

    } else {
      if (perm.size() <= 1)
        continue;
      
      int i = rand<int>(0, perm.size() - 1);
      int j = rand<int>(0, perm.size() - 1);

      int v = perm[i];
      int vp = i == 0 ? start : perm[i - 1];
      int vn = i == perm.size() - 1 ? start : perm[i + 1];

      int u = perm[j];
      int up = j == 0 ? start : perm[j - 1];
      int un = j == perm.size() - 1 ? start : perm[j + 1];

      
      
      
      

      swap(perm[i], perm[j]);

      
      
      
      
    }
    auto score = _partiallyTSP_eval(distanceTable, perm, start) / double(perm.size());
    if (nice > score || exp(double(score - nice) / as_temp) > rand<double>(0, 1)) {
      nice = score;
      if (best > nice)
        best = nice, best_perm = perm;

    } else {
      perm = pp;
      carton = cc;
    }
    as_temp *= 0.995;
    if (loop % 100 == 99) {
      nice = best;
      perm = best_perm;
      set<int> ss(all(perm));
      carton.clear();
      for (auto v : vertices)
        if (!ss.count(v))
          carton.push_back(v);
    }
  }
  return perm;
}

#endif  



namespace Solver {

Graph graph;
Table<int> distanceTable, forwardingTable;
vector<Order> orders;



inline void _updateDestination(Position& player, int dest) {
  updateDestination(player, dest, forwardingTable, distanceTable);
}



void setup() {
  
  graph = inputGraph();
  int tmax;
  scanner >> tmax;
  if (tmax != TMAX) {
    cerr << "invalid T_MAX" << endl;
    abort();
  }
  repeat(t, tmax) {
    int n;
    scanner >> n;
    repeat(i, n) {
      int id, dst;
      scanner >> id >> dst;
      --dst;
      orders.emplace_back(t, dst);
    }
  }
  
  distanceTable.resize(graph.nV);
  forwardingTable.resize(graph.nV);
  buildGraphInformations(distanceTable, forwardingTable, graph);
}



void solve() {
  Position player;

  int orderIdx = 0;
  
  vector<Order> orderQueue;
  
  vector<Order> received;
  
  vector<int> program;

  repeat(time, TMAX) {
    
    if (orderIdx < orders.size() && orders[orderIdx].orderedTime <= time) {
      orderQueue.push_back(orders[orderIdx++]);
    }

    
    while (!program.empty() && player.vertex() == program.back())
      program.pop_back();

    
    if (player.vertex() == 0 && !orderQueue.empty() && program.empty()) {
      
      received.insert(received.end(), all(orderQueue));
      orderQueue.clear();
      
      set<int> sets;
      for (auto o : received)
        sets.insert(o.destination);
      vector<int> ss(all(sets));
      auto pp = partiallyTSP(distanceTable, ss);
      auto score = _partiallyTSP_eval(distanceTable, pp) / pp.size();  
      
      if (score < 150) {
        program = pp;
      }
    }

    
    if (program.empty()) {
      _updateDestination(player, 0);
    } else {
      auto o = program.back();
      _updateDestination(player, o);
    }

    cout << player.succ() + 1 << endl;
  }
}

}  



int main() {
  using namespace Solver;
  setup();
  solve();

  return 0;
}


Measured memory_bytes: 2304