//#include <iostream>
#include<fstream>
#include<vector>
#include<queue>
#define mx 100005
//#define co 1001
#define inf 0x3f3f3f3f
using namespace std;
ifstream fin("distante.in");
ofstream fout("distante.out");
int n,m,s,dist[mx],a[mx];
vector<int> t[mx], v[mx];
struct cmp{
    bool operator() (pair<int,int> a,pair<int, int> b){
    return (a.first>b.first);
    }

};
priority_queue <pair<int, int>, vector<pair<int, int> >,cmp> q;

void citire()
{
    int i,x,y,c;
    fin>>n>>m>>s;
    for(i=1;i<=n;i++)
        {
            fin>>a[i];
        t[i].clear();
        v[i].clear();}
    for(i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        t[x].push_back(y);
        t[y].push_back(x);
        v[x].push_back(c);
        v[y].push_back(c);
    }
    for(i=1;i<=n;i++)
        dist[i]=inf;
    dist[s]=0;
}
void dj(int s)
{
    q.push(make_pair(0,s));
    while(!q.empty())
    {
        int nod=q.top().second;
        int cost=q.top().first;
        q.pop();
        for(unsigned int i=0;i<t[nod].size();++i)
            if(cost+v[nod][i]<dist[t[nod][i]])
        {
            dist[t[nod][i]]=cost+v[nod][i];
            q.push(make_pair(dist[t[nod][i]],t[nod][i]));
        }
    }
}
void afisare() {
int i;
    for (i = 1; i <= n; ++i)
        if (dist[i]!=a[i]) {fout<<"NU\n";break;}
 if (i>n) fout<<"DA\n";
}
int main()
{
    int nrc,k,j,i;
    fin>>nrc;
    for(k=1;k<=nrc;k++)
    {
        citire();
    dj(s);
    afisare();}
     /*int ok=0;
        for(int j=1;j<=n;++j){

                if(j!=s){
                    if(a[j]!=dist[j]){
                        fout<<"NU\n";
                        ok=1;
                        break;
                    }
                }
                else
                    if(a[j]!=0){
                        fout<<"NU\n";
                        ok=1;
                        break;
                    }

        t[j].clear();
        v[j].clear();

        }

        if(ok==0)
            fout<<"DA\n";

    }*/
    return 0;
}