#include <iostream>
#include <fstream>
#include <bitset>
#define N 50002
using namespace std;
ifstream in("distante.in");
ofstream out("distante.out");
bitset<N> v;
int t, n, m, s, a, b, c, d[N];

bool check() {
        v[s] = 1;
        if (d[s] != 0)
                return false;

        for (int i = 1; i <= m; i++) {
                in >> a >> b >> c;
                if (d[a] + c < d[b] || d[b] + c < d[a]) {
                        return false;
                } else if (d[a] + c == d[b]) {
                        v[b] = 1;
                } else if (d[b] + c == d[a]) {
                        v[a] = 1;
                }
        }

        for (int i = 1; i <= n; i++) {
                if (!v[i]) {
                        return false;
                }
        }

        return true;
}

int main() {
        in >> t;

        while (t--) {
                in >> n >> m >> s;
                for (int i = 1; i <= n; i++) {
                        in >> d[i];
                        v[i] = 0;
                }

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