#include <bits/stdc++.h>
using namespace std;
//
#define ll long long
#define ull unsigned long long
#define mx 100010
#define mod 1000000007
#define inf INT_MAX
#define pi acos(-1)
#define endl '\n'
#define pb push_back
#define pll pair<ll, ll>
#define Fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
//
vector<ll> adj[mx];
vector<ll> visited(mx), TTL(mx);

void bfs(ll node, ll ttl) {
    queue<ll> q;
    q.push(node);

    TTL[node] = ttl;
    while (!q.empty()) {
        ll cNode = q.front();
        q.pop();

        if (TTL[cNode] >= 0) {
            if (TTL[cNode] == 0) {
                visited[cNode] = 1;
                continue;
            }

            visited[cNode] = 1;
            for (ll i = 0; i < adj[cNode].size(); i++) {
                if (!visited[adj[cNode][i]] && TTL[adj[cNode][i]] < TTL[cNode] - 1) {
                    q.push(adj[cNode][i]);
                    TTL[adj[cNode][i]] = TTL[cNode] - 1;
                }
            }
        }

    }
}
int main() {
    ll tc = 1;

    while (1) {
        ll nc;
        cin >> nc;
        if (nc == 0) break;

        adj->clear();

        set<ll> nodeCount;
        for (ll i = 0; i < nc; i++) {
            ll a, b;
            cin >> a >> b;

            adj[a].pb(b);
            adj[b].pb(a);

            nodeCount.insert(a);
            nodeCount.insert(b);
        }

        while (1) {
            ll a, b;
            cin >> a >> b;

            if (a == 0 && b == 0) break;

            for (auto it = nodeCount.begin(); it != nodeCount.end(); it++) {
                visited[*it] = 0;
                TTL[*it] = -1;
            }

            bfs(a, b);

            ll count = 0;
            for (auto it = nodeCount.begin(); it != nodeCount.end(); it++) {
                if (visited[*it] == 0) count++;
            }

            cout << "Case " << tc++ << ": " << count <<
                " nodes not reachable from node " << a << " with TTL = " << b << "." << endl;
        }
    }
}