#include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
using namespace std;

typedef long long ll;

template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
    int n = v.size();
    rep(i, 0, n) { os << v[i] << " \n"[i == n - 1]; }
    return os;
}

void solve() {
    int n;
    cin >> n;
    vector<int> p(n, -1);
    rep(i, 1, n) cin >> p[i], p[i]--;
    vector<int> children_count(n, 0), l(n);
    rep(i, 1, n) children_count[p[i]]++;
    rep(i, 1, n) {
        if (children_count[i] >= 2) {
            l[i] = 0;
        } else {
            l[i] = l[p[i]] + 1;
        }
        if (children_count[i] == 0 && l[i] % 2) {
            cout << "First\n";
            return;
        }
    }
    cout << "Second\n";
}

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