#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <stack>
#include <queue>
#include <list>
//#include <windows.h>
//#include <conio.h>
#include <cstdlib>
#include <time.h>
#include <limits.h>
#include <string>
#include <math.h>
using namespace std;
#define forA(V,it) for (typeof(V.begin()) it=V.begin();it!=V.end();it++)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ll long long
#define ull unsigned ll
#define MOD 1000000007
#define INF (1<<31)-1
#define MINF -(1<<31)
#define vi vector <int>
#define vll vector <ll>
#define pii pair <int,int>
#define pll pair <ll,ll>
#define newl printf("\n")
#define DIM 1000000
priority_queue < pii > h;
vector < pii > G[50005];
pii nod;
int N,M,S,D[50005],Test[50005],T,i;
bool viz[50005];
int main()
{
    freopen("distante.in","r",stdin);
    freopen("distante.out","w",stdout);
    scanf("%d",&T);
    while (T--)
    {
        scanf("%d %d %d",&N,&M,&S);
        for (i=1;i<=N;i++) scanf("%d",&Test[i]),D[i]=INF,viz[i]=false;
        for (i=1;i<=M;i++)
        {
            int x,y,z;
            scanf("%d %d %d",&x,&y,&z);
            G[x].pb(mp(y,z));
        }
        D[S]=0;
        h.push(mp(0,S));
        while (!h.empty())
        {
            nod=h.top();
            h.pop();
            int x=nod.se;
            if (viz[x]) continue;
            viz[x]=true;
            for (i=0;i<G[x].size();i++)
            {
                if (G[x][i].se+D[x]<D[G[x][i].fi])
                {
                    D[G[x][i].fi]=G[x][i].se+D[x];
                    h.push(mp(-D[G[x][i].fi],G[x][i].fi));
                }
            }
        }
        bool ok=true;
        for (i=1;i<=N && ok;i++)
        {
            if (D[i]==INF) D[i]=0;
            if (Test[i]!=D[i]) ok=false;
        }
        if (ok) printf("DA\n");
        else printf("NU\n");
        for (i=1;i<=N;i++) while (!G[i].empty()) G[i].pop_back();
    }
    return 0;
}