#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
using i64 = long long;
void solve()
{
    int n;
    cin >> n;
    vector<int> e[n + 1], d(n + 1);
    for (int i = 0; i < n - 1; i++)
    {
        int u, v;
        cin >> u >> v;
        e[u].push_back(v);
        e[v].push_back(u);
        d[u]++, d[v]++;
    }
    vector<int> f(n + 1);
    function<void(int u, int fa)> dfs = [&](int u, int fa)
    {
        f[u] = fa;
        for (auto v : e[u])
        {
            if (v == fa)
                continue;
            dfs(v, u);
        }
    };
    dfs(1, 0);
    int ans = 0;
    map<int, int> mp;
    for (int i = 1; i <= n; i++)
    {
        if (d[i] == 1)
        {
            ans++;
            mp[f[i]]++;
        }
    }
    if (count(d.begin(), d.end(), 1) >= n - 1)
        return void(cout << -1 << endl);
    ans = (ans + 1) / 2;
    for (int i = 1; i <= n; i++)
        ans = max(ans, mp[i]);
    cout << ans << endl;
}
signed main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int tc = 1;
    cin >> tc;
    while (tc--)
        solve();
    return 0;
}