#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <set>
using namespace std;
int n,p,from,to,cost,i,dist[50005],nod,m,teste,t,x[50005],k;

vector < pair < int, int> > G[50005];
set < pair < int, int > > h;
ifstream in("distante.in");
ofstream out("distante.out");
int main()
{
    in>>teste;
    for (t=1; t<=teste; t++)
    {

        while (!h.empty())
            h.erase(h.begin());
        in>>n>>m>>p;
        for (i=1; i<=n; i++)
        {
            in>>x[i];
            dist[i]=50000000;}
            for (i=1; i<=m; i++)
            {
                in>>from>>to>>cost;
                G[from].push_back(make_pair(to,cost));
            }

            dist[p]=0;
            h.insert(make_pair(0,p));
            while (!h.empty())
            {
                int nod=h.begin()->second;
                h.erase(h.begin());
                for (vector < pair < int, int > > ::iterator it=G[nod].begin(); it!=G[nod].end(); it++)
                {
                    int to=it->first;
                    int cost=it->second;
                    if (dist[to]>dist[nod]+cost)
                    {

                        dist[to]=dist[nod]+cost;

                        h.insert(make_pair(dist[to],to));
                    }
                }
            }
            k=0;
            for (i=1; i<=n; i++)
            {

                if (dist[i]!=x[i])
                {
                    k=1;
                    break;
                }
            }
            if (k==1)
                out<<"NU"<<endl;
            else
                out<<"DA"<<endl;
            for (i=1; i<=n; i++)
                G[i].clear();
        }
    }