#include<iostream>
#include<algorithm>
#include<cassert>
#include<random>
#include<set>
#include<map>
#include<cstdlib>
using namespace std;
map<vector<int>,bool>memo;
bool naive(vector<int>P)
{
	for(int i=0;i<P.size();i++)assert(0<=P[i]&&P[i]<=i);
	if(P.empty())return false;
	if(memo.find(P)!=memo.end())return memo[P];
	const int n=P.size()+1;
	bool win=false;
	vector<bool>leaff(n,true);
	for(int p:P)leaff[p]=false;
	vector<int>leaf;
	for(int i=0;i<n;i++)if(leaff[i])leaf.push_back(i);
	for(int j=1;j<1<<leaf.size();j++)
	{
		vector<int>idx(n,0);
		for(int k=0;k<leaf.size();k++)if(j>>k&1)idx[leaf[k]]=-1;
		int sz=0;
		for(int k=0;k<n;k++)if(idx[k]==0)idx[k]=sz++;
		vector<int>nP;
		for(int k=0;k<P.size();k++)if(idx[k+1]!=-1)nP.push_back(idx[P[k]]);
		if(!naive(nP))win=true;
	}
	return memo[P]=win;
}
vector<int>G[2<<17];
int dfs(int u,int d)
{
	if(G[u].empty())return d%2==0;
	if(G[u].size()==1)return dfs(G[u][0],d+1);
	for(int v:G[u])
	{
		int t=dfs(v,1);
		if(t==2)return 2;
		if(t==0)return 0;
	}
	return 2;
}
bool solve(vector<int>P)
{
	for(int i=0;i<P.size();i++)assert(0<=P[i]&&P[i]<=i);
	if(P.empty())return false;
	const int n=P.size()+1;
	vector<int>deg(n,0);
	deg[0]=2;
	for(int p:P)deg[p]++;
	for(int i=0;i<n;i++)if(deg[i]==0)
	{
		int u=i,c=0;
		while(deg[u]<2)u=P[u-1],c++;
		if(c%2)return true;
	}
	return false;
	for(int i=0;i<n;i++)G[i].clear();
	for(int i=0;i<P.size();i++)G[P[i]].push_back(i+1);
	if(dfs(0,0)>=1)return false;
	else return true;
}
string dfs_hash(int u)
{
	if(G[u].empty())return "()";
	vector<string>t;
	for(int v:G[u])t.push_back(dfs_hash(v));
	sort(t.begin(),t.end());
	string s="(";
	for(string v:t)s+=v;
	s+=")";
	return s;
}
set<string>vis;
void gen(int id,vector<int>P)
{
	if(id==P.size())
	{
		const int n=P.size()+1;
		for(int i=0;i<n;i++)G[i].clear();
		for(int i=0;i<P.size();i++)G[P[i]].push_back(i+1);
		string S=dfs_hash(0);
		if(vis.find(S)!=vis.end())return;
		vis.insert(S);
		cout<<S<<endl;
		bool ans=naive(P);
		bool slv=solve(P);
		if(ans!=slv)
		//if(!ans)
		{
			for(int p:P)cout<<p<<" ";
			cout<<endl;
			cout<<ans<<" but "<<slv<<endl;
			//exit(0);
		}
		return;
	}
	for(int p=0;p<=id;p++)
	{
		P[id]=p;
		gen(id+1,P);
	}
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	/*
	for(int N=2;;N++)
	{
		vector<int>P(N-1);
		gen(0,P);
	}
	*/
	int T;cin>>T;
	for(;T--;)
	{
		int N;cin>>N;
		vector<int>P(N-1);
		for(int&p:P)cin>>p,p--;
		cout<<(solve(P)?"First\n":"Second\n");
	}
}