#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e5+5;
unordered_map<int,int>f[N][2];
int t,n,p[N],qz[N],hz[N],sm[N];
int solve(int l,int r,int op){
	if(l>r)return op;
	if(f[l][op].count(r))return f[l][op][r];
	if((op^qz[l-1]^hz[r+1])==op){
		if((r-l+1)%2==0)return 1;
		else if(sm[r]-sm[l-1]>>1&1^op)return 0;
		int res=0;
		if(p[l])res|=solve(l+1,r,qz[l-1]^hz[r+1]^op)^1;
		if(res)return f[l][op][r]=res;
		if(p[r])res|=solve(l,r-1,qz[l-1]^hz[r+1]^op)^1;
		return f[l][op][r]=res;
	}else{
		if((r-l+1)%2==0&&sm[r]-sm[l-1]>>1&1^op)return 0;
		int res=0;
		res|=(solve(l+1,r,qz[l-1]^hz[r+1]^op)^1);
		if(res)return f[l][op][r]=res;
		return f[l][op][r]=solve(l,r-1,qz[l-1]^hz[r+1]^op)^1;
	}
}
signed main(){
	cin>>t;
	while(t--){
		cin>>n;
		int he=0;
		for(int i=1;i<=n;i++)cin>>p[i],he^=p[i],f[i][0].clear(),f[i][1].clear();
		if(!he){
			cout<<"Draw\n";
			continue;
		}
		int t=__lg(he);
		for(int i=1;i<=n;i++){
			p[i]=p[i]>>t&1;
			qz[i]=qz[i-1]^p[i];
			sm[i]=sm[i-1]+p[i];
		}
		hz[n+1]=0;
		for(int i=n;i>=1;i--){
			hz[i]=hz[i+1]^p[i];
		}
		if(solve(1,n,0))cout<<"First\n";
		else cout<<"Second\n";
	}
}