#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
const int inf=100000001;
vector < pair<int,int> > g[50010];
int dmin[50010],B[50010];
class ComparVf
{
public:
    bool operator() (int &x, int &y)
    {
        return dmin[x]>dmin[y];
    }
};
priority_queue <int , vector<int>, ComparVf> q;
int main()
{
    ifstream fin ("distante.in");
    ofstream fout ("distante.out");
    int i,j,k,t,a,b,c,s,n,m,nod,pp;
    fin>>t;
    for(k=1; k<=t; k++)
    {
        fin>>n>>m>>s;
        for(i=1; i<=n; i++)
            fin>>B[i];
        for(i=1; i<=m; i++)
        {
            fin>>a>>b>>c;
            g[a].push_back(make_pair(b,c));
            g[b].push_back(make_pair(a,c));
        }
        q.push(s);
        for(i=1; i<=n; i++)
            dmin[i]=inf;
        dmin[s]=0;
        while(!q.empty())
        {
            nod=q.top();
            q.pop();
            for(i=0; i<g[nod].size(); i++)
            {
                if(dmin[nod]+g[nod][i].second<dmin[g[nod][i].first])
                {
                    dmin[g[nod][i].first]=dmin[nod]+g[nod][i].second;
                    q.push(g[nod][i].first);
                }
            }
        }
        pp=0;
        for(i=1; i<=n; i++)
        {
            if(B[i]!=dmin[i])
                pp=1;
            g[i].clear();
        }
        if(pp==1)
            fout<<"NU\n";
        else
            fout<<"DA\n";
    }
    return 0;
}