#include <fstream>

using namespace std;

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

#define N 50001
#define M 100001
#define INF 2147483647

int t, n, m, s;
int lst[N], vf[2 * M], urm[2 * M], cost[2 * M], nvf = 0;
int d[N], v[N];
int h[N], poz[N], nh = 0;

inline void schimba(int i1, int i2)
{
    swap(h[i1], h[i2]);
    poz[h[i1]] = i1;
    poz[h[i2]] = i2;
}

inline void urca(int i)
{
    while(i >= 2 && d[h[i]] < d[h[i >> 1]])
    {
        schimba(i, i >> 1);
        i >>= 1;
    }
}

inline void coboara(int i)
{
    int bun = i, fs = i << 1, fd = (i << 1) + 1;
    if(fs <= nh && d[h[fs]] < d[h[bun]])
        bun = fs;
    if(fd <= nh && d[h[fd]] < d[h[bun]])
        bun = fd;
    if(bun != i)
    {
        schimba(i, bun);
        coboara(bun);
    }
}

inline void adauga(int x)
{
    h[++nh] = x;
    poz[x] = nh;
    urca(nh);
}

inline void sterge(int i)
{
    schimba(i, nh);
    poz[h[nh]] = 0;
    nh--;
    coboara(i);
}

inline void dijkstra(int x)
{
    for(int i = 1; i <= n; i++)
        d[i] = INF;
    d[x] = 0;
    adauga(x);
    while(nh)
    {
        x = h[1];
        sterge(1);
        for(int i = lst[x]; i; i = urm[i])
            if(d[x] + cost[i] < d[vf[i]])
            {
                d[vf[i]] = d[x] + cost[i];
                if(poz[vf[i]])
                    urca(poz[vf[i]]);
                else
                    adauga(vf[i]);
            }
    }
}

int main()
{
    in >> t;
    while(t--)
    {
        in >> n >> m >> s;

        for(int i = 1; i <= n; i++)
            lst[i] = 0;
        for(int i = 1; i <= nvf; i++)
        {
            vf[i] = 0;
            urm[i] = 0;
        }
        nvf = 0;

        for(int i = 1; i <= n; i++)
            in >> v[i];

        while(m--)
        {
            int x, y, c;
            in >> x >> y >> c;
            vf[++nvf] = y;
            urm[nvf] = lst[x];
            cost[nvf] = c;
            lst[x] = nvf;
            vf[++nvf] = x;
            urm[nvf] = lst[y];
            cost[nvf] = c;
            lst[y] = nvf;
        }

        dijkstra(s);
        bool ok = 1;
        for(int i = 1; i <= n; i++)
            if(v[i] != d[i])
            {
                ok = 0;
                break;
            }

        if(ok)
            out << "DA\n";
        else
            out << "NU\n";
    }
    return 0;
}