// clang-format off
#include <bits/stdc++.h>

using namespace std;

#if __cplusplus < 201400
  #warning "Please use c++14 or higher."
  #define INLINE_V
  #define REGISTER_V register
  #define CPP14CONSTEXPR
  #define gcd __gcd
  #define CPP14ENABLE_IF
#elif __cplusplus < 201700
  #define INLINE_V
  #define REGISTER_V
  #define CPP14CONSTEXPR constexpr
  #define gcd __gcd
  #define CPP14ENABLE_IF ,enable_if_t<_is_integer<T>, int> = 0
#else
  #define INLINE_V inline
  #define REGISTER_V
  #define CPP14CONSTEXPR constexpr
  #define CPP14ENABLE_IF ,enable_if_t<_is_integer<T>, int> = 0
#endif

#if !defined(_WIN32) && !defined(LOCK_GETCHAR)
  #define getchar getchar_unlocked
#endif

#define il inline
#define mkp make_pair
#define fi first
#define se second
#define For(i,j,k) for(REGISTER_V int i=(j);i<=(k);++i) // NOLINT
#define ForDown(i,j,k) for(REGISTER_V int i=(j);i>=(k);--i) // NOLINT
#define pb push_back
#define eb emplace_back
#define FileIO(filename) freopen(filename".in","r",stdin);freopen(filename".out","w",stdout)

using ll = long long;
using lll = __int128_t;
using uint = unsigned int;
using ull = unsigned long long;
using ulll = __uint128_t;
using db = double;
using ldb = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

#if __cplusplus >= 201400
  template <class T> INLINE_V constexpr bool _is_integer = numeric_limits<T>::is_integer;
  template <> INLINE_V constexpr bool _is_integer<__int128> = true;
  template <> INLINE_V constexpr bool _is_integer<__uint128_t> = true;
  template <> INLINE_V constexpr bool _is_integer<bool> = false;
  template <> INLINE_V constexpr bool _is_integer<char> = false;
  template <class T CPP14ENABLE_IF>
    INLINE_V constexpr T INF = numeric_limits<T>::max() >> 1;
#endif

template<typename T> constexpr il T sq(const T & x){return x*x;}
template<typename T> CPP14CONSTEXPR il T cmin(T & x, const T &y){x=min(x,y);}
template<typename T> CPP14CONSTEXPR il T cmax(T & x, const T &y){x=max(x,y);}
template<typename T> CPP14CONSTEXPR il T qpow(T x, ull y, T mod){T ans=1;x%=mod;while(y){if(y&1)(ans*=x)%=mod;(x*=x)%=mod;y>>=1;}return ans;}
template<typename T> CPP14CONSTEXPR il T qpow(T x, ull y){T ans=1;while(y){if(y&1)ans*=x;x*=x;y>>=1;}return ans;}
template<typename T CPP14ENABLE_IF> il void read(T &x){ x=0;int f=1;int c=getchar();while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}while(isdigit(c)){x=x*10+c-'0';c=getchar();}x*=f;}
template<typename T, typename ... Args> il void read(T &x, Args &... y){ read(x);read(y...); }

// File head end
// clang-format on

namespace {
constexpr ll MAXN = 205;
int T, n, a[MAXN];
bool f[MAXN][MAXN][8];
il void solve() {
  read(n);
  For(i, 1, n) read(a[i]);
  memset(f, 0, sizeof(f));
  For(i, 1, n) {
    if (a[i])
      f[i][i][2] = f[i][i][6] = 1;
    else
      f[i][i][0] = f[i][i][4] = 1;
  }
  For(len, 2, n) For(i, 1, n - len + 1) {
    int j = i + len - 1;
    if (a[i]) {
      if (f[i + 1][j][4]) {
        f[i][j][2] = 1;
      } else if (f[i + 1][j][6] || f[i + 1][j][5]) {
        f[i][j][0] = f[i + 1][j][6];
        f[i][j][3] = f[i + 1][j][5];
      } else if (f[i + 1][j][7]) {
        f[i][j][1] = 1;
      }

      if (f[i + 1][j][0]) {
        f[i][j][5] = 1;
      } else if (f[i + 1][j][2] || f[i + 1][j][1]) {
        f[i][j][4] = f[i + 1][j][1];
        f[i][j][7] = f[i + 1][j][2];
      } else if (f[i + 1][j][3]) {
        f[i][j][6] = 1;
      }
    } else {
      if (f[i + 1][j][6]) {
        f[i][j][2] = 1;
      } else if (f[i + 1][j][7] || f[i + 1][j][4]) {
        f[i][j][0] = f[i + 1][j][4];
        f[i][j][3] = f[i + 1][j][7];
      } else if (f[i + 1][j][5]) {
        f[i][j][1] = 1;
      }

      if (f[i + 1][j][1]) {
        f[i][j][5] = 1;
      } else if (f[i + 1][j][3] || f[i + 1][j][0]) {
        f[i][j][4] = f[i + 1][j][0];
        f[i][j][7] = f[i + 1][j][3];
      } else if (f[i + 1][j][2]) {
        f[i][j][6] = 1;
      }
    }

    if (a[j]) {
      if (f[i][j - 1][4]) {
        f[i][j][2] = 1;
      } else if (f[i][j - 1][6] || f[i][j - 1][5]) {
        f[i][j][0] = f[i][j - 1][6];
        f[i][j][3] = f[i][j - 1][5];
      } else if (f[i][j - 1][7]) {
        f[i][j][1] = 1;
      }

      if (f[i][j - 1][0]) {
        f[i][j][5] = 1;
      } else if (f[i][j - 1][2] || f[i][j - 1][1]) {
        f[i][j][4] = f[i][j - 1][1];
        f[i][j][7] = f[i][j - 1][2];
      } else if (f[i][j - 1][3]) {
        f[i][j][6] = 1;
      }
    } else {
      if (f[i][j - 1][6]) {
        f[i][j][2] = 1;
      } else if (f[i][j - 1][7] || f[i][j - 1][4]) {
        f[i][j][0] = f[i][j - 1][4];
        f[i][j][3] = f[i][j - 1][7];
      } else if (f[i][j - 1][5]) {
        f[i][j][1] = 1;
      }

      if (f[i][j - 1][1]) {
        f[i][j][5] = 1;
      } else if (f[i][j - 1][3] || f[i][j - 1][0]) {
        f[i][j][4] = f[i][j - 1][0];
        f[i][j][7] = f[i][j - 1][3];
      } else if (f[i][j - 1][2]) {
        f[i][j][6] = 1;
      }
    }

    if (f[i][j][2])
      f[i][j][3] = 0;
    if (f[i][j][0])
      f[i][j][1] = 0;
    if (f[i][j][5])
      f[i][j][7] = 0;
    if (f[i][j][4])
      f[i][j][6] = 0;
  }
  if (f[1][n][2])
    puts("First");
  else if (f[1][n][1])
    puts("Second");
  else if (f[1][n][0] || f[1][n][3])
    puts("Draw");
  else
    assert(0);
}
il void solver_main() {
  read(T);
  while (T--)
    solve();
}
} // namespace

signed main() { return solver_main(), 0; }