#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define inf 50001
using namespace std;
ifstream f("distante.in");
ofstream g("distante.out");
int t,n,m,S, d[inf], s[inf];

vector < pair<int, int> > v[inf];
vector <int> db;
priority_queue < pair<int, int> > q;

void citire()
{
    int i,j,c,k;
        f>>n>>m>>S;
        for(i=1; i<=n; i++)
           v[i].clear();
    db.clear();

        for(k=1; k<=n; k++)
        {
            f>>c;
            db.push_back(c);
        }
        for(k=1; k<=m; k++)
        {
            f>>i>>j>>c;
            v[i].push_back({j,c});
            v[j].push_back({i,c});
        }
}

void dijkstra(int start)
{
    int i,poz, nod, cost;

    for(i=1; i<=n; i++)
        {d[i]=inf; s[i]=0;}
    d[start]=0;
    q.push({0, start });
    while(!q.empty())
    {
        poz=q.top().second;
        q.pop();
        if(s[poz]==0)
        { s[poz]=1;
            for(i=0; i<v[poz].size(); i++)
            {
                cost=v[poz][i].second;
                nod=v[poz][i].first;
                    if(d[nod]>d[poz]+cost)
                {
                    d[nod]=d[poz]+cost;
                    q.push({ -d[nod], nod });
                }
            }
        }
    }
}

int main()
{
    int i,j, ok;
    f>>t;
    for(i=1; i<=t; i++)
    {ok=1;
        citire();
        dijkstra(S);
        for(j=1; j<=n; j++)
            if(d[j]==inf)
            d[j]=0;
        for(j=1; j<=n; j++)
            if(d[j]!=db[j-1])
            {ok=0; break;}
        if(ok==0)
            g<<"NU"<<endl;
        else
            g<<"DA"<<endl;
    }
    f.close();
    g.close();
    return 0;
}