#include <bits/stdc++.h>

const int N = 2e5 + 7;

int n, ret;
std::vector<int> tr[N];

void dfs(int x, int y) {
  if(!tr[x].size())
    ret |= y;
  if(tr[x].size() >= 2)
    y = 0;
  for(int v: tr[x])
    dfs(v, y + 1);
}

void solve() {
  scanf("%d", &n);
  for(int i = 1; i <= n; ++i)
    tr[i].clear();
  for(int i = 2, x; i <= n; ++i) {
    scanf("%d", &x);
    tr[x].push_back(i);
  }
  ret = 0;
  dfs(1, 0);
  puts(ret & 1 ? "First" : "Second");
}

int main() {

  int cases;
  scanf("%d", &cases);

  while(cases--)
    solve();
	
  return 0;
}