#include <fstream>
#include <vector>
#include <queue>
#include <climits>
using namespace std;
ifstream fin("distante.in");
ofstream fout("distante.out");
int m,s,n;
const int nmax=50005;
const int oo=INT_MAX;
vector < pair <int,int> > muchii[nmax];
int d[nmax];
bool inCoada[nmax];
struct cmp
{
    bool operator() (int x,int y)
    {
        return d[x]>d[y];
    }
};
priority_queue<int, vector <int>, cmp> q;
void dijkstra(int s)
{
    for (int i=1;i<=n;i++)
    {
        d[i]=oo;
    }
    d[s]=0;
    q.push(s);
    inCoada[s]=true;
    while (!q.empty())
    {
        int nod=q.top();
        q.pop();
        inCoada[nod]=false;
        for (int i=0;i<muchii[nod].size();i++)
        {
            int vecin=muchii[nod][i].first;
            int cost=muchii[nod][i].second;
            if (d[nod]+cost<d[vecin])
            {
                d[vecin]=d[nod]+cost;
                if (inCoada[vecin]==false)
                {
                    q.push(vecin);
                    inCoada[vecin]=true;
                }
            }
        }
    }
}
int main()
{
    int t;
    fin >> t;
    for (int i=1;i<=t;i++)
    {
        fin >> n >> m >> s;
        int delir[nmax];
        for (int i=1;i<=n;i++)
        {
            fin >> delir[i];
        }
        for (int i=1;i<=m;i++)
        {
            int x,y,c;
            fin >> x >> y >> c;
            muchii[x].push_back(make_pair(y,c));
            muchii[y].push_back(make_pair(x,c));
        }
        dijkstra(s);
        bool ok=true;
        for (int i=1;i<=n;i++)
        {
            if (d[i]!=delir[i])
            {
                ok=false;
                break;
            }
        }
        if (ok==true) fout << "DA";
        else fout << "NU";
        fout << '\n';
    }
}