#include <fstream>
#include <cstdio>
#include <vector>
#include <queue>
#define VAL 50005

using namespace std;

int T, N, M, i, j;
int a, b, c, S, k;
int cost[VAL], x[VAL];
vector<int> v[VAL];
vector<int> p[VAL];
queue<int> q;
bool ok;

void bfs()
{
    q.push(S);
    while (q.empty()==false)
    {
        a=q.front();
        q.pop();
        for (i=0; i<v[a].size(); i++)
        {
            if (cost[v[a][i]]==-1)
            {
                cost[v[a][i]]=cost[a]+p[a][i];
                q.push(v[a][i]);
            }
            else
            {
                if (cost[v[a][i]]>cost[a]+p[a][i])
                {
                    cost[v[a][i]]=cost[a]+p[a][i];
                    q.push(v[a][i]);
                }
            }
        }
    }
}

int main()
{
    freopen("distante.in", "r", stdin);
    freopen("distante.out", "w", stdout);
    scanf("%d", &T);
    for (k=1; k<=T; k++)
    {
        scanf("%d %d %d", &N, &M, &S);
        ok=true;
        for (i=1; i<=N; i++)
          scanf("%d", &x[i]);
        for (i=1; i<=M; i++)
        {
            scanf("%d %d %d", &a, &b, &c);
            v[a].push_back(b);
            v[b].push_back(a);
            p[a].push_back(c);
            p[b].push_back(c);
        }
        if (x[S]!=0)
        {
            ok=false;
            printf("NU\n");
        }
        else
        {
            for (i=1; i<=N; i++)
              if (i!=S)
                cost[i]=-1;
            bfs();
        }
        for (i=1; i<=N; i++)
        {
            if (cost[i]!=x[i])
              ok=false;
            cost[i]=0;
            v[i].clear();
            p[i].clear();
        }
        if (ok==true)
          printf("DA\n");
        else
          printf("NU\n");
    }
    return 0;
}