#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define infinit 10000000
#define lmax 60000
using namespace std;

struct muchie
{
    int inf;
    int cost;
}y;

vector <muchie>v[lmax];
int d[lmax];
queue<int> Q;
int s,n;

void bf()
{
    int i,x;
    Q.push(s);

    d[1]=0;
    for(i=2;i<=n;i++)
    {
        d[i]=infinit;
    }
    while(Q.size()!=0)
    {
        x=Q.front();
        Q.pop();
        for(i=0;i<v[x].size();i++)
        {
            if(d[v[x][i].inf]>d[x]+v[x][i].cost)
            {
                Q.push(v[x][i].inf);
                d[v[x][i].inf]=d[x]+v[x][i].cost;
            }
        }
    }
}
int main()
{
    int i,m,t,d1[lmax],a,ok;
    ifstream f("distante.in");
    ofstream g("distante.out");

    f>>t;

    while(t--)
    {
        f>>n>>m>>s;
        for(i=1;i<=n;i++)
            {
                f>>d1[i];
            }
        for(i=1;i<=m;i++)
        {
            f>>a>>y.inf>>y.cost;
            v[a].push_back(y);
            swap(a,y.inf);
            v[a].push_back(y);
        }
        bf();
        ok=1;
        for(i=1;i<=n;i++)
        {
            if(d1[i]!=d[i])
            {
                cout<<i;
                g<<"NU"<<"\n";
                i=n;
                ok=0;
            }
        }
        if(ok==1)
        {
            g<<"DA"<<"\n";
        }
    }
}