#include <bits/stdc++.h>
using namespace std;
ifstream fin("distante.in");
ofstream fout("distante.out");
int t, n, m, s;
long long dist_real[50004];
long long dist[50004];
vector<pair<int, int>> adj[50004];
bitset<50004> viz;
queue<int> Q;
void bfs(int v)
{
    viz[v] = true;
    dist_real[v] = 0;
    Q.push(v);
    while (!Q.empty())
    {
        int v = Q.front();
        Q.pop();
        for (auto u : adj[v])
        {
            if (!viz[u.first] || (dist_real[v] + u.second < dist_real[u.first]))
            {
                viz[u.first] = true;
                dist_real[u.first] = dist_real[v] + u.second;
                Q.push(u.first);
            }
        }
    }
}
void solve()
{
    fin >> n >> m >> s;
    for (int i = 1; i <= n; i++)
    {
        fin >> dist[i];
    }
    for (int i = 1; i <= n; i++)
    {
        adj[i].clear();
        dist_real[i] = 0;
        viz[i] = false;
    }
    for (int i = 1; i <= m; i++)
    {
        int a, b, d;
        fin >> a >> b >> d;
        adj[a].push_back({b, d});
        adj[b].push_back({a, d});
    }
    bfs(s);
    bool ok = true;
    for (int i = 1; i <= n; i++)
    {
        if (dist[i] != dist_real[i])
        {
            ok = false;
            break;
        }
    }
    ok ? fout << "DA\n" : fout << "NU\n";
}
int main()
{
    fin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}