//
// Created by aaaa on 2024/10/8.
//
#include<bits/stdc++.h>
using namespace std;
#define int long long
void solve()
{
    int n;
    cin >> n;
    vector<vector<int> > g(n+1);
    for(int i = 2; i <= n; i++){
        int u;
        cin >> u;
        g[u].push_back(i);
    }
    vector<int> dis(n+1,0);
    vector<int> fa(n+1,0);
    auto dfs1 = [&](auto dfs1,int u)->void {
        for(auto v:g[u]){
            fa[v] = u;
            dfs1(dfs1,v);
            dis[u] = max(dis[v]+1,dis[u]);
        }
    };
    dfs1(dfs1,1);
    vector<vector<int> > dv(dis[1]+1);
    for(int i = 1; i <= n; i++){
//        cerr << dis[i] << " ";
        dv[dis[i]].push_back(i);
    }
    vector<int> sz(n+1,0);
    int ans = 1;
    for(int i = 1; i <= n; i++)sz[i] = g[i].size(),ans += max(0ll,sz[i]-1);
    int cnt = ans;
//    cerr << cnt << "\n";
    for(int i = 0; i < dv.size(); i++){
        auto vt = dv[i];
        for(auto u:vt){
            if(sz[fa[u]]>=2){
//                cerr<<u << " ";
                ans--;;
            }
            sz[fa[u]]--;
        }
        cnt = min(cnt,ans+i+1);
    }
    cout << cnt << "\n";
}
signed main()
{
    int t;
    cin >> t;
    while (t--)solve();
}

/*
 2
 7
 1 1 2 2 2 3
 5
 1 2 3 4
 */
/*
 1
 12
 1 1 2 2 4 3 7 7 8 9 9
 */
/*
 1
 13
 1 1 2 2 2 3 3 4 5 6 7 8
 */