#include <fstream>
#include <vector>
#include <queue>
#define INF 0x3f3f3f
using namespace std;
ifstream is ("distante.in");
ofstream os ("distante.out");

vector<pair<int,int> > V[50001];
priority_queue< pair<int,int>, vector<pair<int,int> >, greater<pair<int,int> > > Q;
vector <int> d, d2;

int t, n, m, s, q;

void Read();
void Dijkstra();

int main()
{
    is >> t;
    while(t)
    {
        Read();
        Dijkstra();
        int i;
        for(i = 1; i <= n; ++i)
            if(d[i] != d2[i])
            {
                os << "NU\n";
                i = n+2;
                q++;
            }
        if(q == 0)
            os << "DA\n";
        q = 0;
        --t;
    }

    is.close();
    os.close();
    return 0;
}
void Read()
{
    int a, b, c;
    is >> n >> m >> s;
    d.resize(n+1, 0);
    for(int i = 1; i <= n; ++i)
        is >> d[i];
    for(int i = 1; i <= m; ++i)
    {
        is >> a >> b >> c;
        V[a].push_back({c, b});
    }
    d2.resize(n+1, INF);
    Q.push({0, s});
    d2[s] = 0;
}
void Dijkstra()
{
    int dist, nod;
    while(!Q.empty())
    {
        dist = Q.top().first;
        nod = Q.top().second;
        Q.pop();
        vector<pair<int,int> >::iterator it;
        for(it = V[nod].begin(); it != V[nod].end(); ++it)
            if(d2[it->second] > dist + it->first)
            {
                d2[it->second] = dist + it->first;
                Q.push({d2[it->second], it->second});
            }
    }
}