A Node too far

/*
*@Author: Kabid Hasan
*@Date: Sunday 2021-Apr-25
*@Time: 16:35:52
*/
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> p32;
typedef pair<ll, ll> p64;
typedef pair<double, double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typedef vector<vector<int> > vv32;
typedef vector<vector<ll> > vv64;
typedef vector<vector<p64> > vvp64;
typedef vector<p64> vp64;
typedef vector<p32> vp32;
ll MOD = 998244353;
double eps = 1e-12;
#define forn(i,e) for(ll i = 0; i < e; i++)
#define forsn(i,s,e) for(ll i = s; i < e; i++)
#define rforn(i,s) for(ll i = s; i >= 0; i--)
#define rforsn(i,s,e) for(ll i = s; i >= e; i--)
#define ln "\n"
#define dbg(x) cout<<#x<<" = "<<x<<ln
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define INF 2e18
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())

int bfs(int n, vector<int>  ad[], int st, int ttl) {
    vector<int> vis(10000, -1);
    queue<int> q;
    q.push(st);
    vis[st] = 0;
    int c = 1;
    while (q.size()) {
        int fr = q.front();
        if (vis[fr] == ttl) break;
        q.pop();
        for (auto nd : ad[fr]) {
            if (vis[nd] == -1) {
                vis[nd] = vis[fr] + 1;
                q.push(nd);

                c++;
            }
        }


    }

    return n - c;
}

void solve()
{   int cs=0;
    int nc;
    while (cin >> nc and nc) {
        set<int> st;
        vector<int> ad[10000];
        int n = nc;
        while (nc--) {

            int a, b;
            cin >> a >> b;
            ad[a].pb(b);
            ad[b].pb(a);
            st.insert(a); st.insert(b);

        }

        int a,b;
        while (cin >> a >> b and a) {

            cout << "Case " << ++cs << ": "<< bfs(st.size(), ad, a, b) <<" nodes not reachable from node "<<a<<" with TTL = "<<b<< endl;
        }


    }


}



int main()
{
    fast_cin();
    ll t = 1;
    //cin >> t;
    for ( int it = 1; it <= t; it++) {
        //cout << "Case " << it << ": ";
        solve();
    }
    return 0;
}