#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <set>
#define INF 1 << 29
#define NMAX 50002
using namespace std;

struct punct
{
    int nod,cost;
}p,v;


ifstream in("distante.in");
ofstream out("distante.out");




int n,m,x,y,s,c,t,ds[NMAX];
bool verf[NMAX];

bool dijkstra()
{

    if(ds[s]!=0) return false;

    for(int i=1;i<=m;i++)
        {
            in >> x >> y >> c;
            if(ds[x] == ds[y] + c)
                verf[x] = true;
            if(ds[y] == ds[x] +c )
                verf[y] = true;
        }
    for(int i=1;i<=n;i++)
        if(!verf[i])
            return false;

        return true;
}

int main()
{
    in >> t;

    for(int k=0;k<t;k++)
    {
        in >> n >> m >> s;
        for(int i=1;i<=n;i++)
        {
            in >> ds[i];
        }


        if(dijkstra())
            out << "DA" << "\n";
        else
            out << "NU" << "\n";

    }

    return 0;
}