#include <fstream>
#include <vector>
#include <queue>
#define Max 100001
#define Inf 1 << 30
#define vecin first
#define cost second
using namespace std;

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

vector <pair<int,int>> graf[Max];
queue <int> q;

int T, n, m, s, x, y, z, d[Max], distanta[Max];

void bfs (int nod)
{
    q.push(nod);
    d[nod] = 0;
    while (!q.empty())
    {
        nod = q.front();
        q.pop();
        for (auto i : graf[nod])
            if (d[nod] + i.cost < d[i.vecin])
            {
                d[i.vecin] = d[nod] + i.cost;
                q.push(i.vecin);
            }
    }
}

void inf()
{
    for (int i = 1 ; i <= n ; ++i)
        d[i] = Inf;
}

bool ver()
{
    for (int i = 1 ; i <= n ; ++i)
        if (d[i] != distanta[i])
            return false;
    return true;
}

void graf_clear()
{
    for (int i = 1 ; i <= n ; ++i)
        graf[i].clear();
}

int main()
{
    fin >> T;
    for (int t = 1 ; t <= T ; ++t)
    {
        fin >> n >> m >> s;
        for (int i = 1 ; i <= n ; ++i)
            fin >> distanta[i];
        for (int i = 1 ; i <= m ; ++i)
        {
            fin >> x >> y >> z;
            graf[x].push_back({y, z});
            graf[y].push_back({x, z});
        }
        inf();
        bfs(s);
        graf_clear();
        if (ver())
            fout << "DA\n";
        else
            fout << "NU\n";
    }

    fin.close();
    fout.close();
    return 0;
}