#include <fstream>
#include <vector>
#include <queue>
#define inf 100000000000
using namespace std;
ifstream f("distante.in");
ofstream g("distante.out");
priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > >h;
vector<pair<int,int> >v[200010];
int n,m,t,s,x,y,c,ok;
long long d1[100005],d[100005];
bool viz[100005];
void dijkstra()
{
    int i,j;
    h.push({0,1});
    while(!h.empty())
    {
        int nod=h.top().second;
        h.pop();

            for(int i=0;i<v[nod].size();++i)
            {
                if(d[nod]+v[nod][i].first<d[v[nod][i].second])
                {

                    d[v[nod][i].second]=d[nod]+v[nod][i].first;
                    h.push({ d[v[nod][i].second],v[nod][i].second});

                }
            }

    }
}
int main()
{
    int i,j;
    f>>t;
    while(t)
    {
        f>>n>>m>>s;
        for(j=1;j<=n;j++) {viz[j]=0;f>>d1[j];d[j]=inf;}
        for(j=1;j<=m;j++)
        {
            f>>x>>y>>c;
            v[x].push_back({c,y});
            v[y].push_back({c,x});
        }
        d[s]=0;
        dijkstra();
        for(j=1;j<=n;j++)
        {
            if(d[j]==inf) d[j]=0;
        }
        ok=1;
        for(j=1;j<=n&&ok==1;j++)
        {
            if(d[j]!=d1[j]) ok=0;
        }
        if(ok==1) g<<"DA";
        else g<<"NU";
        g<<'\n';
        for(j=1;j<=n;j++) v[j].clear();
        t--;
    }
    return 0;
}