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

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

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

void bf()
{
    int prim,ultim,i,j,x,y;
    ultim=1;
    prim=1;
    coada[1]=1;

    for(i=1;i<=n;i++)
    {
        d[i]=infinit;
    }
    d[s]=0;

    while(prim<=ultim)
    {
        x=coada[prim++];
        for(i=0;i<v[x].size();i++)
        {
            if(d[v[x][i].inf]>d[x]+v[x][i].cost)
            {
                coada[++ultim]=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;
        cout<<n<<" "<<m<<" "<<s<<"\n";
        for(i=1;i<=n;i++)
            {
                f>>d1[i];
            }
        for(int aux,i=1;i<=m;i++)
        {
            f>>a>>y.inf>>y.cost;
            v[a].push_back(y);
            aux=a;
            a=y.inf;
            y.inf=aux;
            v[a].push_back(y);
        }
        if(d1[s]==0)
        {
            bf();
            ok=1;
            for(i=1;i<=n;i++)
            {
                if(d1[i]!=d[i])
                {
                    g<<"NU"<<"\n";
                    i=n;
                    ok=0;
                }
            }
            if(ok==1)
            {
                g<<"DA"<<"\n";
            }
        }
        else
        {
            g<<"NU\n";
        }
    }

}