#include <iostream>
#include <cstdio>
#include <bitset>

using namespace std;

const int NMax = 50005;
int T, N, M, S;
int d[NMax], dist[NMax];
bitset < NMax > viz;

struct muchie
{
    int x, y, c;
}v[NMax];

int Check()
{
    for(int i=1; i<=N; ++i)
        viz[i] = 0;

    if(d[S] != 0)
        return 0;

    viz[S] = 1;

    for(int i=1; i<=M; ++i)
        {if(d[v[i].x] + v[i].c < d[v[i].y] && d[v[i].y] + v[i].c > d[v[i].x])
            return 0;
         if(d[v[i].x] + v[i].c == d[v[i].y])
            viz[v[i].y] = 1;
        }

    for(int i=1; i<=N; ++i)
        if(!viz[i])
            return 0;

    return 1;
}

void Read()
{
    scanf("%d", &T);

    for(int i=1; i<=T; ++i)
    {
        scanf("%d %d %d", &N, &M, &S);

        for(int j=1; j<=N; ++j)
            scanf("%d", &d[j]);

        for(int j=1; j<=M; ++j)
        {
            scanf("%d %d %d", &v[j].x, &v[j].y, &v[j].c);
        }

        if(Check())
            cout << "DA\n";
        else
            cout << "NU\n";
    }
}

int main()
{
    freopen("distante.in", "r", stdin);
    freopen("distante.out", "w", stdout);

    Read();

    return 0;
}