def main():
    n = int(input())
    P = [-1] + list(map(lambda x: int(x)-1, input().split()))
    node = [[] for _ in range(n)]
    for u in range(1, n):
        node[P[u]].append(u)
    A = [0] * n
    for u in node[0]:
        A[u] = 1
    for u in range(n):
        if not A[u]: continue
        le = len(node[u])
        if le == 0:
            return "First"
        elif le == 1:
            v = node[u][0]
            for w in node[v]:
                A[w] = 1
        else:
            for v in node[u]:
                A[v] = 1
    return "Second"

for _ in range(int(input())):
    print(main())