#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#define inf 1000000000
#define maxN 50002
using namespace std;
int n, N, m, s, t, i, j, d[maxN], D[maxN], H[maxN], poz[maxN];
bool used[maxN];
vector < pair <int, int> > V[maxN];
inline int father(int nod) {
    return nod / 2;
}

inline int left_son(int nod) {
    return nod * 2;
}

inline int right_son(int nod) {
    return nod * 2 + 1;
}
void sift(int N, int K) {
    int son;
    do {
        son = 0;
        if (left_son(K) <= N) {
            son = left_son(K);
            if (right_son(K) <= N && d[H[right_son(K)]] < d[H[left_son(K)]]) {
                son = right_son(K);
            }
            if (d[H[son]] >= d[H[K]]) {
                son = 0;
            }
        }

        if (son) {
            swap(poz[H[K]], poz[H[son]]);
            swap(H[K], H[son]);
            K = son;
        }
    } while (son);
}
void percolate(int N, int K) {
    int key = H[K];

    while ((K > 1) && (d[key] < d[H[father(K)]])) {
        H[K] = H[father(K)];
        poz[H[father(K)]] = K;
        K = father(K);
    }

    H[K] = key;
    poz[key] = K;
}
void cut(int& N, int K) {
    if (N == K)
    {
        poz[H[K]] = 0;
        -- N;
        return ;
    }
    H[K] = H[N];
    poz[H[N]] = K;
    --N;

    if ((K > 1) && (d[H[K]] < d[H[father(K)]])) {
        percolate(N, K);
    } else {
        sift(N, K);
    }
}
void insert(int& N, int key) {
    H[++N] = key;
    poz[key] = N;
    percolate(N, N);
}
void solve();
void write();
void read()
{
    int a, b, c;
    freopen("distance.in", "r", stdin);
    freopen("distance.out", "w", stdout);
    scanf("%d", &t);
    while (t --)
    {
        scanf("%d %d %d", &n, &m, &s);
        for (i = 1; i <= n; ++ i)
        {
            scanf("%d", &D[i]);
            V[i].clear();
            used[i] = 0;
        }

        for (i = 1; i <= m; ++ i)
        {
            scanf("%d %d %d", &a, &b, &c);
            V[a].push_back(make_pair(b, c));
        }
        if (D[s] != 0)
        {
            printf("NU\n");
            continue;
        }
        solve();
        write();
    }
}
void solve()
{
    int i, x, node;
    for (i = 1; i <= n; ++ i)
    {
        d[i] = inf;
        poz[i] = 0;
    }
    d[s] = 0;
    insert(N, s);
    while (N)
    {
        x = H[1];
        used[x] = 1;
        cut(N, 1);
        for (i = 0; i < V[x].size(); ++ i)
            if (!used[V[x][i].first])
        {
            node = V[x][i].first;
            if (d[node] > d[x] + V[x][i].second)
            {
                d[node] = d[x] + V[x][i].second;
                if (poz[node])
                    cut(N, poz[node]);
                insert(N, node);
            }
        }
    }
}
void write()
{
    int i;
    for (i = 1; i <= n; ++ i)
        if (D[i] != d[i])
    {
        printf("NU\n");
        return ;
    }
    printf("DA\n");
}
int main()
{
    read();
    return 0;
}