#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <cstring>
#define inf 0x3f3f3f3f
#define pb push_back
#define nmax 50002
using namespace std;
ifstream in("distante.in");
ofstream out("distante.out");
struct eee
{
    int nod,cost;
    bool operator <(const eee &a)const
    {
        return cost>a.cost;
    }
};
int n,m,s,d[nmax],dmin[nmax],a,b,c,t;
vector <eee> v[nmax];
priority_queue<eee> q;
void dijkstra(int nd)
{
    int x,y;
    memset(dmin,inf,sizeof dmin);
    dmin[nd]=0;
    q.push({nd,0});
    while(!q.empty())
    {
        x=q.top().nod;
        y=q.top().cost;
        q.pop();
        if(y!=dmin[x])continue;
        for(auto i:v[x])
        {
            if(dmin[i.nod]>dmin[x]+i.cost)
            {
                dmin[i.nod]=dmin[x]+i.cost;
                q.push({i.nod,dmin[i.nod]});
            }
        }
    }
}
bool cond()
{
    for(int i=1;i<=n;i++)
    {
        if(d[i]!=dmin[i])return 0;
        v[j].clear();
    }
    return 1;
}
int main()
{
    in>>t;
    for(int i=1;i<=t;i++)
    {
        in>>n>>m>>s;
        for(int j=1;j<=n;j++)
        {
            in>>d[j];
        }
        for(int j=1;j<=m;j++)
        {
            in>>a>>b>>c;
            v[a].pb({b,c});
            v[b].pb({a,c});
        }
        dijkstra(s);
        if(cond())out<<"DA";
        else out<<"NU";
        out<<'\n';
    }
    return 0;
}