def main():
    n = int(input())
    P = [-1] + list(map(lambda x: int(x)-1, input().split()))
    A = [1] * n
    B = [0] * n
    for i in P[1:]:
        B[i] += 1
    S = [i for i in range(n) if not B[i]]
    while S:
        u = S.pop()
        if u == 0:
            continue
        v = P[u]
        B[v] -= 1
        if not B[v]:
            S.append(v)
        if A[u]:
            if not A[v]:
                return "First"
            A[u], A[v] = 0, 0
    if A[0] and max(A[1:]) == 0:
        return "Second"
    else:
        return "First"

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