import sys,time

from itertools import permutations
from heapq import heappop,heappush
from collections import deque
import random
import bisect

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

def solve(N,parent):
    child = [[] for v in range(N)]
    for v in range(1,N):
        child[parent[v]].append(v)
    
    dp0 = [""] * N
    dp1 = [""] * N
    for v in range(N)[::-1]:
        if len(child[v]) == 0:
            dp0[v] = "Second"
            dp1[v] = "First"
        elif len(child[v]) == 1:
            c = child[v][0]
            dp0[v] = dp1[c]
            dp1[v] = dp0[c]
        else:
            flg = False
            for c in child[v]:
                if dp1[c] == "First":
                    flg = True
            dp0[v] = "First" if flg else "Second"
            dp1[v] = dp0[v]
    
    return dp0[0]

for _ in range(int(input())):
    N = int(input())
    parent = [-1] + [int(p)-1 for p in input().split()]
    print(solve(N,parent))