#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cstdio>
#include<map>
#include<utility>
#include<set>
#include<queue>
	
using namespace std;
#define FOR(i,n) for(int i=0,i##_end=(n);i<i##_end;i++)
#define MP make_pair
int solve(vector<int>&price , vector<vector<int> >&route,
	  vector<int>&itinerary , int n , vector<int>&ticket)
{
  int m=(int)itinerary.size();
  itinerary.push_back(-1); //
  typedef pair<int,pair<int,pair<int,pair<int,int> > > > data_t  ;
  priority_queue<
    data_t,vector<data_t> , greater<data_t>
    >qu;
  int val=-1;
  map<pair<int,int>,pair<int,int> > memo;
  qu.push(MP(0,MP(1,MP(itinerary[0],MP(-1,-1)))));
  while(!qu.empty())
    {
      int cost=qu.top().first;
      int step=qu.top().second.first;
      int pos =qu.top().second.second.first;
      int tic =qu.top().second.second.second.first;
      int pstep =qu.top().second.second.second.second;
      qu.pop();
      if(memo.find(MP(step,pos))!=memo.end())
	continue;
      memo[MP(step,pos)]=MP(pstep,tic);
      if(step==m && pos==itinerary[m-1]){
	val = cost ; break;
      }
      FOR(i,n)
	{
	  if(route[i][0]!=pos) continue;
	  int st=step;
	  FOR(j,route[i].size())
	    {
	      if(itinerary[st]==route[i][j]) st++;
	      qu.push(MP(cost+price[i],MP(st,MP(route[i][j],MP(i,step)))));
	    }
	}
    }
  {
    pair<int,int> now(m,itinerary[m-1]),next;
    ticket.clear();
    while(1){
      if(memo.find(now) == memo.end()) abort();
      pair<int,int> pre = memo[now]; 
      int ti = pre.second;
      if(ti == -1) break;
      ticket.push_back(ti+1);
      now = MP(pre.first,route[ti].front());
    }
    reverse(ticket.begin(),ticket.end());
  }
  return val;
}
int main(){
  int n,case_no=1;
  while(cin>>n&&n)
    {
      vector<int> price(n);
      vector<vector<int> > route(n);
      FOR(i,n){
	cin>>price[i]; 
	int t; cin>>t;
	FOR(_,t){
	  int x; cin>>x;
	  route[i].push_back(x-1);
	}
      }
      int m; cin >> m;
      FOR(i,m){
	int t; cin >> t;
	vector<int> itinerary (t);
	FOR(j,t) {
	  cin>>itinerary[j]; itinerary[j]--;
	}
	int ans = 0;
	vector<int> ticket;
	ans = solve(price, route , itinerary , n , ticket);
	printf("Case %d, Trip %d: Cost = %d\n",
	       case_no, i+1 , ans);
	printf("  Tickets used:");
	FOR(j,ticket.size()) printf(" %d" , ticket[j]);
	puts("");
      }
      case_no++;
    }
  return 0;
}