#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define ld long double
#define lld long long double
#define endl "\n"
#define fastio()                      \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL);                    \
    cout.tie(NULL);                   \
    srand(chrono::high_resolution_clock::now().time_since_epoch().count());
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }

template <typename T, typename V>
void __print(const pair<T, V> &x)
{
    cerr << '{';
    __print(x.first);
    cerr << ',';
    __print(x.second);
    cerr << '}';
}
template <typename T>
void __print(const T &x)
{
    int f = 0;
    cerr << '{';
    for (auto &i : x)
        cerr << (f++ ? "," : ""), __print(i);
    cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v)
{
    __print(t);
    if (sizeof...(v))
        cerr << ", ";
    _print(v...);
}
#ifndef ONLINE_JUDGE
#define debug(x...)               \
    cerr << "[" << #x << "] = ["; \
    _print(x)
#else
#define debug(x...)
#endif

vector<ll> dp;
vector<ll> sz;
vector<ll> *adj;

void dfs(ll node, ll parent)
{
    ll sz_node = sz[node] - 1;
    vector<ll> children_sz;
    vector<ll> children_dp;
    for (auto x : adj[node])
    {
        if (x != parent)
        {
            dfs(x, node);
            children_sz.pb(sz[x]);
            children_dp.pb(dp[x]);
        }
    }
    if (children_sz.size() == 0)
    {
        dp[node] = 0;
        return;
    }
    if (children_sz.size() == 1)
    {
        dp[node] = children_sz[0];
        return;
    }
    if (children_sz.size() == 2)
    {
        dp[node] = children_dp[0] + children_dp[1];
        return;
    }
    vector<ll> minus;
    ll sum = 0;
    for (ll i = 0; i < children_dp.size(); i++)
    {
        minus.pb(children_dp[i] - children_sz[i]);
        sum += children_sz[i];
    }
    sort(minus.begin(), minus.end());
    dp[node] = sum + minus[0] + minus[1];
    return;
}
void dfs1(ll node, ll par)
{
    sz[node] = 1;
    for (auto x : adj[node])
    {
        if (x != par)
        {
            dfs1(x, node);
            sz[node] += sz[x];
        }
    }
}
void solve(ll cc)
{
    ll n;
    cin >> n;
    adj = new vector<ll>[n];
    for (ll i = 0; i < n - 1; i++)
    {
        ll u, v;
        cin >> u >> v;
        u--, v--;
        adj[u].pb(v);
        adj[v].pb(u);
    }
    ll ans = 1e9;
    dp.resize(n);
    sz.resize(n);
    for (ll i = 0; i < n; i++)
    {
        fill(dp.begin(), dp.end(), 0);
        fill(sz.begin(), sz.end(), 0);
        dfs1(i, -1);
        dfs(i, -1);
        ans = min(ans, dp[i]);
    }
    cout << "Case #" << cc << ": ";
    cout << ans << endl;
    delete[] adj;
}

signed main()
{
    fastio();
    int t;
    cin >> t;
    int T = t;
    for (int i = 1; i <= T; i++)
        solve(i);
    return 0;
}