#include <iostream>
#include <vector>

using namespace std;

struct Node {
  // paths info
  vector<int> to;
  vector<int> cost;

  // Dijkstra-related
  bool done;
  int c; // cost
  int from;
};

int main() {
  int n;
  int casenum = 0;
  while (cin >> n, n) {
    casenum++;

    Node nodes[11];
    for (int i=1; i<=n; i++) {
      int m;
      cin >> m;
      for (int j=0; j<m; j++) {
        int to, cost;
        cin >> to >> cost;
        nodes[i].to.push_back(to);
        nodes[i].cost.push_back(cost);
      }
      nodes[i].done = false;
      nodes[i].c = -1;
    }

    int start, end;
    cin >> start >> end;

    // Dijkstra's shortest path find
    nodes[start].c = 0;
    while (true) {
      int min_idx = -1;
      for (int i=1; i<=n; i++) {
        if (nodes[i].done) { continue; }
        if (nodes[i].c < 0) { continue; }
        if (min_idx < 0 || nodes[i].c < nodes[min_idx].c) { min_idx = i; }
      }
      if (min_idx < 0) { break; }

      nodes[min_idx].done = true;
      for (int i=0; i<nodes[min_idx].to.size(); i++) {
        int to = nodes[min_idx].to[i];
        int cost = nodes[min_idx].c + nodes[min_idx].cost[i];
        if (nodes[to].c < 0 || cost < nodes[to].c) {
          nodes[to].c = cost;
          nodes[to].from = min_idx;
        }
      }
    }

    // constructing the answer path
    vector<int> path;
    for (int idx = end; idx != start; idx = nodes[idx].from) {
      path.push_back(idx);
    }
    path.push_back(start);

    cout << "Case " << casenum << ": Path =";
    for (int i=path.size()-1; i>=0; i--) {
      cout << " " << path[i];
    }
    cout << "; " << nodes[end].c << " second delay" << endl;
  }

  return 0;
}