#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
    ll n,i=0,a,b,k;

    map<ll,ll>m;
    //cout<<"K";
    ll j=1;
    while(cin>>n && n!=0)
    {
        vector<ll>v[10005];
        m.clear();
        ll p=1;
        while(n--)
        {
            cin>>a>>b;
            if(m[a]==0) m[a]=p++;
            if (m[b]==0) m[b]=p++;
            v[m[a]].push_back(m[b]);
            v[m[b]].push_back(m[a]);
        }
        bool vis[10005];

        ll lev[10010];
        ll u;

        while(cin>>a>>k && a!=0 && k!=0)
        {
            ll cnt=0;
            queue<ll>q;
            memset(vis,false,sizeof(vis));
            memset(lev,0,sizeof(lev));
            q.push(m[a]);
            vis[m[a]]=true;
            lev[m[a]]=0;
            while(!q.empty())
            {
                ll p=q.front();
                q.pop();
                for(ll i=0;i<v[p].size();i++)
                {

                    if(vis[v[p][i]]==false)

                        {
                            vis[v[p][i]]=true;
                            lev[v[p][i]]=lev[p]+1;
                            if(lev[v[p][i]]<=k)
                            {
                                q.push(v[p][i]);
                                cnt++;
                            }
                        }

                    }
                }cout<<"Case "<<j++<<": "<<p-cnt-2<<" nodes not reachable from node "<<a<<" with TTL = "<<k<<"."<<endl;
          }
      }
  }