#include <iostream>
#include <vector>
#include <fstream>
#include <queue>
#define INF 2000000000
using namespace std;

int dmin[50002], dtmin[50002];
int n, m, T, x0;
vector <pair <int, int> > G[50002];

class compar
{
public:
    bool operator () (const int &x, const int &y)
    {
        return dmin[x]>dmin[y];
    }
};

priority_queue <int, vector<int>, compar> q;

void dijkstra()
{
    int vfmin;
    for(int i=1; i<=n; ++i)
    {
        dmin[i]=INF;
    }
    dmin[x0]=0;
    q.push(x0);
    while(!q.empty())
    {
        vfmin=q.top(); q.pop();
        for(int i=0; i<G[vfmin].size(); ++i)
        {
            if(dmin[G[vfmin][i].first] > dmin[vfmin] + G[vfmin][i].second)
            {
               dmin[G[vfmin][i].first] = dmin[vfmin] + G[vfmin][i].second;
               q.push(G[vfmin][i].first);
            }
        }
    }
}

int drumuri()
{
    for(int i=1; i<=n; ++i)
    {
        if(dmin[i]!=dtmin[i])
            return 0;
    }
    return 1;
}

void read()
{
    ifstream f("distante.in");
    ofstream g("distante.out");
    f >> T;
    for(int i=0; i<T; ++i)
    {
        f >> n >> m >> x0;
        for(int j=1; j<=n; ++j)
        {
            f >> dtmin[j];
        }
        for(int j=0, x, y, c; j<m; ++j)
        {
            f >> x >> y >> c;
            G[x].push_back(make_pair(y,c));
            G[y].push_back(make_pair(x,c));
        }

        dijkstra();
        if(drumuri())
            g << "DA" << '\n';
        else
            g << "NU" << '\n';

        for(int j=0; j<=n; ++j)
        {
            G[j].clear();
        }

    }
    f.close();
    g.close();
}

int main()
{
    read();
    return 0;
}