/*#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;
}
*/
#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;

struct comp{

    bool operator () (punct a, punct b)
    {
        if(a.cost < b.cost)
            return true;
        return false;
    }
};

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

vector<punct> a[NMAX];
set<punct,comp> T;

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

bool dijkstra()
{

    d[s] = 0;
    p.nod = s;
    p.cost = 0;

    T.insert(p);
    while(!T.empty())
    {
        p = (*T.begin());
        T.erase(T.begin());
       // cout << p.nod<< " ";

        for(int i=0;i<a[p.nod].size();i++)
        {
            if(d[a[p.nod][i].nod]> p.cost + a[p.nod][i].cost)
            {
                d[a[p.nod][i].nod] = p.cost + a[p.nod][i].cost;
                v.nod = a[p.nod][i].nod;
                v.cost=d[a[p.nod][i].nod];
                T.insert(v);
            }

        }
    }
    for(int i=1;i<=n;i++)
        if(d[i]!=ds[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];
           a[i].clear();
            d[i] = INF;
        }
        for(int i=1;i<=m;i++)
        {
            in >> x >> y >> c;
            p.cost = c;
            p.nod = y;
            a[x].push_back(p);
            p.nod = x;
            a[y].push_back(p);
        }

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

    }

    return 0;
}