#include <iostream>
#include <fstream>
#include <bitset>
#define N 50002
using namespace std;
ifstream in("distante.in");
ofstream out("distante.out");

int main() {
        bitset<N> v;
        int t, n, m, s, a, b, c, d[N];
        in >> t;

        while (t--) {
                v.reset();
                in >> n >> m >> s;

                for (int i = 1; i <= n; i++)
                        in >> d[i];
                if (d[s] != 0) {
                        out << "NU\n";
                        continue;
                }

                for (int i = 1; i <= m; i++) {
                        in >> a >> b >> c;
                        if (d[a] + c < d[b]) {
                                out << "NU\n";
                                break;
                        } else if (d[a] + c == d[b]) {
                                v[b] = 1;
                        }
                }
                bool correct = true;
                for (int i = 1; i < s; i++) {
                        if (!v[i]) {
                                correct = false;
                                break;
                        }
                }
                for (int i = s + 1; i <= n; i++) {
                        if (!v[i]) {
                                correct = false;
                                break;
                        }
                }
                if (correct)
                        out << "DA\n";
        }
        return 0;
}