#include<stdio.h>
#include<string.h>
#include<vector>
using namespace std;
#define ITERATOR vector < pair <int, int> >::iterator

const int NMAX = 50010;

vector < pair <int, int> > graph[NMAX];
bool vis[NMAX];
int dmin[NMAX];

int dfs (int node) {
    vis[node] = 1;
    for(ITERATOR it = graph[node].begin(); it != graph[node].end(); ++ it)
        if(!vis[it->first]) {
            if(dfs(it->first) == 0)
                return 0;
        }
    if(node == 1)
        return dmin[node] == 0;

    bool flag = 0;
    for(ITERATOR it = graph[node].begin(); it != graph[node].end(); ++ it) {
        if(dmin[it->first] > dmin[node] + it->second)
            return 0;
        if(dmin[it->first] + it->second == dmin[node])
            flag = 1;
    }
    return flag;
}

int main() {
    freopen("distante.in", "r", stdin);
    freopen("distante.out", "w", stdout);
    int tc, n, m, i, a, b, c, src;

    scanf("%d", &tc);
    while(tc) {
        -- tc;
        memset(vis, 0, sizeof(vis));

        scanf("%d%d%d", &n, &m, &src);
        for(i = 1; i <= n; ++ i) {
            scanf("%d", &dmin[i]);
            graph[i].clear();
        }
        for(i = 1; i <= m; ++ i) {
            scanf("%d%d%d", &a, &b, &c);
            graph[a].push_back(make_pair(b, c));
            graph[b].push_back(make_pair(a, c));
        }

        if(dfs(src))
            printf("DA\n");
        else
            printf("NU\n");
    }
    return 0;
}