#include <fstream>
#include <vector>
#include <queue>
using namespace std;

ifstream fin("distante.in");
ofstream fout("distante.out");

struct nodecost
{
    int node,cost;

    bool operator < (const nodecost other) const{

            return cost > other.cost;
    }
};

int n,m,dist[50005];
vector <nodecost> g[50005];
priority_queue <nodecost> pq;
const int INF = 2e9;


void dijkstra(int p)
{
    for(int i=1;i<=n;i++)
        dist[i]=INF;

    pq.push({p,0});

    while(!pq.empty())
    {
        int currnode = pq.top().node;
        int currdist = pq.top().cost;
        pq.pop();

        if(dist[currnode] == INF)
        {
            dist[currnode] = currdist;

            for(auto it : g[currnode])
                if(dist[it.node] == INF)
                    pq.push({it.node,currdist+it.cost});
        }
    }
}

int main()
{
    int t;
    fin>>t;
    for(int pas=1; pas<=t; pas++)
    {
        for(int i=1;i<=n;i++)
        g[i].clear();
        int p,sol[50005];
        fin>>n>>m>>p;
        for(int i=1;i<=n;i++)
            fin>>sol[i];
        for(int i=1;i<=m;i++)
        {
            int a,b,c;
            fin>>a>>b>>c;
            g[a].push_back({b,c});
            g[b].push_back({a,c});
        }
        if(sol[p]!=0)
        {
            fout<<"NU"<<'\n';
            continue;
        }
        dijkstra(p);
        int ok=1;
        for(int i=1;i<=n;i++)
            if(sol[i]!=dist[i]&&i!=p)
                ok=0;
        if(ok==1)
            fout<<"DA"<<'\n';
        else
            fout<<"NU"<<'\n';
    }
    return 0;
}