#include <iostream>
#include <cstdio>
#include <queue>
#include <bitset>
#include <vector>
#define mp make_pair
#define pb push_back
using namespace std;
const int Max=50005;
const int inf=0x3f3f3f3f;
int T,n,m,s;
int d[Max],dist[Max];
vector < pair < int , int > >V[Max];
bitset < Max >viz;

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

int verificare()
{
    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])
            return 0;

         if(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;

        if(d[v[i].y] + v[i].c ==  d[v[i].x])
            viz[v[i].x] = 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)
        {
            int x, y, c;
            scanf("%d %d %d", &v[j].x, &v[j].y,&v[j].c);
        }
        if(verificare())
            cout << "DA\n";
        else
            cout << "NU\n";
    }
}

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

    Read();

    return 0;
}