#include <bits/stdc++.h>

using namespace std;

const int N = 1e6 + 10;

int T, n;
int fa[N], son[N];
vector <int> v[2];

int main() {
    cin >> T;
    while(T --) {
        cin >> n;

        for(int i = 1; i <= n; i ++) fa[i] = son[i] = 0;
        v[0].clear();
        v[1].clear();

        for(int i = 2; i <= n; i ++) {
            cin >> fa[i];
            son[fa[i]] ++;
        }

        for(int i = 1; i <= n; i ++)
            if(!son[i])
                v[0].push_back(i);

        int ans = v[0].size();
        int now = 0;

        //1 2 3 5 4 2 7 7
        for(int i = 1; i <= n; i ++) {
            v[now ^ 1].clear();

            for(auto j : v[now]) {
                son[fa[j]] --;

                if(!son[fa[j]]) v[now ^ 1].push_back(fa[j]);
            }

            now ^= 1;
            ans = min(ans, int(v[now].size()) + i);
        }

        cout << ans << endl;
    }
}