// Problem: 货币系统
// Contest: AcWing
// URL: https://www.acwing.com/problem/content/description/534/
// Memory Limit: 128 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

// %%%Skyqwq
#include <bits/stdc++.h>

//#define int long long
#define help {cin.tie(NULL); cout.tie(NULL);}
#define pb push_back
#define fi first
#define se second
#define mkp make_pair
using namespace std;

typedef long long LL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;

template <typename T> bool chkMax(T &x, T y) { return (y > x) ? x = y, 1 : 0; }
template <typename T> bool chkMin(T &x, T y) { return (y < x) ? x = y, 1 : 0; }

template <typename T> void inline read(T &x) {
    int f = 1; x = 0; char s = getchar();
    while (s < '0' || s > '9') { if (s == '-') f = -1; s = getchar(); }
    while (s <= '9' && s >= '0') x = x * 10 + (s ^ 48), s = getchar();
    x *= f;
}

const int N=25005;
int n,a[105],t;
bool f[N];
int main()
{
    for(cin>>t;t;t--)
    {
        cin>>n;
        for(int i=1;i<=n;i++)cin>>a[i];
        sort(a+1,a+1+n);
        int mx=a[n],res=0;
        memset(f,0,sizeof f);
        f[0]=true;
        for(int i=2;i<=n;i++)
        {
            if(f[a[i]])continue;
            res++;
            for(int j=a[i];j<=mx;j++)f[j]|=f[j-a[i]];
        }
        puts(res+1==n?"DA":"NE");
    }
    return 0;
}