#include <stdio.h>

int solve(int N, int par[])
{
	int u, w;
	static int depth[200001], deg[200001];
	for (u = 2, depth[1] = 0, deg[1] = 0; u <= N; u++) {
		depth[u] = depth[par[u]] + 1;
		deg[u] = 0;
		deg[par[u]]++;
	}
	for (u = 2; u <= N; u++) if (depth[u] % 2 != 0 && deg[u] != 1) return 1;
	return 0;
}

int main()
{
	int T, i, N, p[200001];
	scanf("%d", &T);
	while (T--) {
		scanf("%d", &N);
		for (i = 2; i <= N; i++) scanf("%d", &(p[i]));
		if (solve(N, p) != 0) printf("First\n");
		else printf("Second\n");
	}
	fflush(stdout);
	return 0;
}