#include <bits/stdc++.h>
using namespace std;
using ll = long long;

void solve(){
    ll N;
    cin>>N;
    vector<vector<int>> G(N);
    vector<int> D(N,0);
    vector<int> E(N,0);
    for(int i=0;i<N-1;i++){
        int p;
        cin>>p;
        p--;
        G[i+1].push_back(p);
        D[i+1]=D[p]+1;
        E[p]++;
        E[i+1]++;
    }
    for(int i=1;i<N;i++){
        if(D[i]%2==1&&E[i]!=2){
            cout<<"First"<<endl;
            return;
        }
    }
    cout<<"Second"<<endl;
}

int main() {
    ll T;
    cin>>T;
    while(T--)solve();
}