#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <cmath>

using namespace std;

#define file_in "distante.in"
#define file_out "distante.out"

#define nmax 123232
#define s second
#define f first

int T;
int n,m;
int d[nmax];


void citire()
{
    freopen(file_in,"r",stdin);
    freopen(file_out,"w",stdout);

    scanf("%d\n", &T);

}



void solve()
{
    int i,a,b,c,nod,p,u;
    while(T--)
    {
         scanf("%d %d %d", &n, &m, &nod);

         for (i=1;i<=n;++i) scanf("%d", &d[i]);
            int ok=1;
            if (d[nod]!=0) ok=0;
            for (i=1;i<=m;++i)
            {
                scanf("%d %d %d", &a, &b, &c);
                if (d[a]+c<d[b])
                    ok=0;
                 if (d[b]+c<d[a])
                 ok=0;
            }

                 if (ok)
                 printf("DA\n");
                 else
                 printf("NU\n");
    }
}

int main()
{
    citire();
    solve();

    fclose(stdin);
    fclose(stdout);

    return 0;
}