#include <bits/stdc++.h>
#define oo 2e9

using namespace std;

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

vector<pair<int, int>> L[50005];
priority_queue<pair<int, int>> q;
bitset<50005> viz;
int n, start, T;
int d[50005], dist[50005];

void Citire()
{
    int x, y, m, cost;
    fin >> n >> m >> start;
    for(int i = 1; i <= n; i++)
        fin >> dist[i];
    for(int i = 1; i <= m; i++)
    {
        fin >> x >> y >> cost;
        L[x].push_back({cost, y});
        L[y].push_back({cost, x});
    }
}

void Dijkstra(int x)
{
    int k;
    for(int i = 1; i <= n; i++)
            d[i] = oo;
    d[x] = 0;
    q.push({0, x});
    while(!q.empty())
    {
        k = q.top().second;
        q.pop();
        if(!viz[k])
        {
            viz[k] = 1;
            for(auto e : L[k])
                if(d[e.second] > d[k] + e.first)
                {
                    d[e.second] = d[k] + e.first;
                    q.push({-d[e.second], e.second});
                }
        }
    }
}

void Verif()
{
     for(int i = 1; i <= n; i++)
        if(d[i] != dist[i])
        {
             fout << "NU" << "\n";
             return;
        }
     fout << "DA" << "\n";
}

void Reset()
{
    for(int i = 1; i <= n; i++)
        L[i].clear();
    viz.reset();
}

int main()
{
    fin >> T;
    while(T)
    {
        Citire();
        Dijkstra(start);
        Verif();
        Reset();
        T--;
    }
    fin.close();
    fout.close();
    return 0;
}