#include <iostream>
#include <queue>
#include <fstream>

using namespace std;

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

const int nmax = 50005, val_mare = 20000*50000;
vector<pair<int, int> > list_vec[nmax];
int dist[nmax], in_coada[nmax], n, m, a[nmax], start;

struct cmp
{
    bool operator() (int x, int y)
    {
        return dist[x] > dist[y];
    }
};
priority_queue<int, vector<int>, cmp > pq;

void citire()
{
    fin>>n>>m>>start;
    int i, u, v, c;

    for(i = 1; i <= n; ++i)
        fin>>a[i];
    for(i = 1; i <= m; ++i)
    {
        fin>>u>>v>>c;
        list_vec[u].push_back({v, c});
        list_vec[v].push_back({u, c});
    }
}

void dijkstra()
{
    int cost, curent, vecin;

    for(int i = 1; i <= n; ++i)
        dist[i] = val_mare;

    dist[start] = 0;
    in_coada[start] = 1;
    pq.push(start);

    while(!pq.empty())
    {
        curent = pq.top();
        pq.pop();
        in_coada[curent] = 0;
        for(auto a : list_vec[curent])
        {
            vecin = a.first;
            cost = a.second;
            if(dist[vecin] > dist[curent] + cost)
            {
                dist[vecin] = dist[curent] + cost;
                if(!in_coada[vecin])
                {
                    in_coada[vecin] = 1;
                    pq.push(vecin);
                }
            }
        }
    }
}

bool ok()
{
    for(int i = 1; i <= n; ++i)
    {
        if(dist[i] != a[i])
            return 0;
    }
    return 1;
}

void curat()
{
    for(int i = 1; i <= n; ++i)
    {
        list_vec[i].clear();
        in_coada[i] = 0;
    }
}
int main()
{
    int i, t;
    fin>>t;

    for(i = 1; i <= t; ++i)
    {
        citire();
        dijkstra();
        if(ok())
            fout<<"DA";
        else
            fout<<"NU";
        fout<<'\n';
        curat();
    }

    return 0;
}