#include<fstream>
#include<vector>
#include<cstring>
#include<queue>
using namespace std;
#define NMAX 50005
#define x first
#define y second
#define INF 0x3f3f3f3f
ifstream f("distante.in");
ofstream g("distante.out");
vector < pair <int,int> > v[NMAX];
int t,m,n,s,D[NMAX];
queue <int> q;
void rez()
{
    int x,y,c,i;
    bool ok=true;
    memset(D,0x3f,sizeof(D));
    f>>n>>m>>s;
    for (i=1;i<=n;++i) f>>D[i];
    if (D[s]) ok=false;
    for (i=1;i<=m;++i)
    {
        f>>x>>y>>c;
        v[x].push_back(make_pair(y,c));
        v[y].push_back(make_pair(x,c));
    }
    q.push(s);
    while (!q.empty() && ok)
    {
        x=q.front(); q.pop();
        for (auto it: v[x])
        {
            y=it.x, c=it.y;
            if (D[x]+c<D[y])
                ok=false;
            else if (D[x]+c==D[y])
            {
                q.push(y);
            }
        }
    }
    while (!q.empty()) q.pop();
    if (ok) g<<"DA\n";
    else g<<"NU\n";
}
int main()
{
    int i;
    f>>t;
    for (i=0;i<t;++i)
        rez();
    return 0;
}