#include <bits/stdc++.h>

using namespace std;

ifstream f("distante.in");
ofstream g("distante.out");
int d[50010];
int N;
int main()
{
    f >> N;
    for (int i = 0; i < N; i++) {
        int n, m, s;
        f >> n >> m >> s;
        for (int i = 1; i <= n; i++) f >> d[i];
        int ok = 0;
        if (d[s] != 0) ok = 1;
        for (int i = 0; i < m; i++) {
            int x, y, c;
            f >> x >> y >> c;
            if (d[x] + c < d[y] || d[y] + c < d[x]) ok = 1;
        }
        if (ok == 0) g << "DA \n";
            else g << "NU \n";
    }

    return 0;

}