#include <fstream>
#include <algorithm>
#define Nmax 50099
#define Mmax 100099
#define Inf 999999999
using namespace std;
ifstream f("distante.in");
ofstream g("distante.out");
int n,m,S,d[Nmax],v[Nmax];
struct muchie{int x,y,c;} a[Mmax];

inline void ReadInput()
{
    f>>n>>m>>S;
    for(int i=1;i<=n;i++)f>>v[i];
    fill(d+1,d+n+1,Inf);
    for(int i=1;i<=m;i++)
    {
        f>>a[i].x>>a[i].y>>a[i].c;
        if(a[i].x==S) d[a[i].y]=a[i].c;
        if(a[i].y==S) d[a[i].x]=a[i].c;
    }
}

inline void Dijkstra()
{
    int gata=0;
    while(!gata)
    {
        gata=1;
        for(int i=1; i<=m; i++ )
            if(d[a[i].y]>d[a[i].x]+a[i].c)
            {
                gata=0;
                d[a[i].y]=d[a[i].x]+a[i].c;
            }
           else
            if(d[a[i].x]>d[a[i].y]+a[i].c)
            {
                gata=0;
                d[a[i].x]=d[a[i].y]+a[i].c;
            }
    }
}

inline bool OK()
{
    for(int i=1;i<=n;i++)if(d[i]==Inf || i==S)d[i]=0;
    for(int i=1;i<=n;i++)if(d[i]!=v[i])return false;
    return true;
}
int main()
{
    int t;
    f>>t;
    for(int i=1;i<=t;i++)
    {
        ReadInput();
        Dijkstra();
        if(OK())g<<"DA"<<'\n';
        else g<<"NU"<<'\n';
    }
    f.close();g.close();
    return 0;
}