#include <bits/stdc++.h>
using namespace std;

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

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

void Reset()
{
    for (int i = 1; i <= n; i++)
    {
        L[i].clear();
        d[i] = 2e9;
    }
    viz.reset();
}
void Dijkstra(int k)
{
    d[k] = 0;
    q.push({0, k});
    while (!q.empty())
    {
        k = q.top().second;
        q.pop();
        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});
            }
    }
}

int main()
{
    int t, i, j, c;
    fin >> T;
    for (t = 1; t <= T; t++)
    {
        fin >> n >> m >> s;
        for (i = 1; i <= n; i++)
            fin >> dist[i];
        Reset();
        while (m--)
        {
            fin >> i >> j >> c;
            L[i].push_back({c, j});
            L[j].push_back({c, i});
        }

        Dijkstra(s);
        c = 1;
        for (i = 1; i <= n; i++)
            if (d[i] != dist[i])c = 0;
        if (c == 1)fout << "DA\n";
        else fout << "NU\n";

    }
    return 0;
}