#include <fstream>
#include <vector>
#include <queue>
#include <cstring>
#include <functional>
#define M 2000000000
using namespace std;
ifstream fin("distante.in");
ofstream fout("distante.out");
int t, i, n, m, s, d[50010], dv[50010], a, b, c, viz[50010], k, ver;
vector < pair < int, int > >g[50010];
priority_queue < pair < int, int >, vector < pair < int, int > >, greater < pair < int, int > > >qu;
void dij()
{
    while(!qu.empty())
    {
        int nod = qu.top().second;
        qu.pop();
        if(viz[nod] == 0)
        {
            viz[nod] = 1;
            for(int i = 0; i < g[nod].size(); i++)
            {
                if(d[g[nod][i].first] > d[nod] + g[nod][i].second)
                    d[g[nod][i].first] = d[nod] + g[nod][i].second;
                if(viz[g[nod][i].first] == 0)
                    qu.push({d[g[nod][i].first], g[nod][i].first});
            }
        }
    }
}
int main()
{
    fin >> t;
    for(k = 1; k <= t; k++)
    {
        fin >> n >> m >> s;
        for(i = 1; i <= n; i++)
            {
                d[i] = M;
                viz[i] = 0;
                g[i].clear();
            }
        d[s]=0;
        for(i = 1; i <= n; i++)
            fin >> dv[i];
        for(i = 1; i <= m; i++)
        {
            fin >> a >> b >> c;
            g[a].push_back({b, c});
            g[b].push_back({a, c});
        }
        qu.push({0, s});
        dij();
        ver = 1;
        for(i = 1; i <= n; i++)
            if(dv[i] != d[i])
            {
                ver = 0;
                break;
            }
        if(ver == 1)
            fout << "DA" << '\n';
        else
            fout << "NU" << '\n';
    }
    return 0;
}