#include <fstream>
#include<vector>
#include<queue>
#define NMAX 50001
#include<climits>
#define INF INT_MAX
using namespace std;
ifstream fin("distante.in");
ofstream fout("distante.out");
vector<pair<int,int>>v[NMAX];
priority_queue<pair<int,int>, vector<pair<int,int>>,greater<pair<int,int>>>pq;
int t,n,w[NMAX],m,x,y,cost,start,d[NMAX];
bool viz[NMAX],ok;
void dijkstra(int start)
{
        d[start]=1;
        pq.push({1,start});
        while(!pq.empty())
        {
            int nod=pq.top().second;
            int cost=pq.top().first;
            pq.pop();
            if(viz[nod]==1)
                continue;
            viz[nod]=1;
            for(int i=0;i<v[nod].size();i++)
            {
                int vecin=v[nod][i].first;
                int costv=v[nod][i].second;
                if(d[vecin]>cost+costv)
                {
                    d[vecin]=cost+costv;
                    pq.push({d[vecin],vecin});
                }
            }
        }
}
void initializare(int n)
{
    for(int i=1;i<=n;i++)
        {
            d[i]=INF;
            viz[i]=0;
        }
}
int main()
{
    fin>>t;
    while(t--)
    {
        fin>>n>>m>>start;
        for(int i=1;i<=n;i++)
            fin>>w[i];
        for(int i=1;i<=m;i++)
        {
            fin>>x>>y>>cost;
            v[x].push_back({y,cost});
            v[y].push_back({x,cost});
        }
        initializare(n);
        dijkstra(start);
        ok=1;
        for(int i=1;i<=n;i++)
            if(w[i]!=d[i]-1)
        {
            ok=0;
            break;
        }
        if(ok==1)
            fout<<"DA\n";
        else
            fout<<"NU\n";

    }
    return 0;
}