#include <bits/stdc++.h>

using namespace std;

#define N 50005
#define M 100005

const int INF = INT_MAX;
int vf[M], cst[M], urm[M], lst[N], n, nr;

void clear_graph() {
    nr = 0;
    for(int i = 1; i <= n; ++i)
        lst[i] = 0;
}

void add_graph(int x, int y, int c) {
    vf[++nr] = y;
    cst[nr] = c;
    urm[nr] = lst[x];
    lst[x] = nr;
}

int d[N], d_chk[N];
typedef pair<int, int> p_int;
bool dijkstra(int S) {
    priority_queue< p_int, vector<p_int>, greater<p_int> > pq;
    pq.push(make_pair(0, S));

    for(int i = 1; i <= n; ++i)
        d[i] = INF;
    d[S] = 0;

    do {
        int x = pq.top().second;
        pq.pop();

        for(int p = lst[x]; p; p = urm[p]) {
            int y = vf[p];
            if(d[y] > d[x] + cst[p]) {
                d[y] = d[x] + cst[p];
                pq.push(make_pair(d[y], y));
            }
        }
    } while(!pq.empty());

    for(int i = 1; i <= n; ++i)
        if(d[i] != d_chk[i]) {
            if(d[i] == INF && d_chk[i] == 0) {}
            else return false;
        }
    return true;
}

int main() {
    ifstream fin("distante.in");
    ofstream fout("distante.out");

    int T, S, m, x, y, z;

    fin >> T; do {
        clear_graph();
        fin >> n >> m >> S;
        for(int i = 1; i <= n; ++i)
            fin >> d_chk[i];
        do {
            fin >> x >> y >> z;
            add_graph(x, y, z);
        } while(--m);
        if(dijkstra(S))
            fout << "DA\n";
        else fout << "NU\n";
    } while(--T);
}