#include <iostream>
#include <fstream>
#include <vector>
#include <utility>

using namespace std;

class InputReader {
    public:
        InputReader() {}
        InputReader(const char *file_name) {
            input_file = fopen(file_name, "r");
            cursor = 0;
            fread(buffer, SIZE, 1, input_file);
        }
        inline InputReader &operator >>(int &n) {
            while(buffer[cursor] < '0' || buffer[cursor] > '9') {
                advance();
            }
            n = 0;
            while('0' <= buffer[cursor] && buffer[cursor] <= '9') {
                n = n * 10 + buffer[cursor] - '0';
                advance();
            }
            return *this;
        }
    private:
        FILE *input_file;
        static const int SIZE = 1 << 17;
        int cursor;
        char buffer[SIZE];
        inline void advance() {
            ++ cursor;
            if(cursor == SIZE) {
                cursor = 0;
                fread(buffer, SIZE, 1, input_file);
            }
        }

    };


const int NMAX = 50000 + 5;
const int MMAX = 2 * NMAX;

int d[NMAX];

vector <pair <int, int> > graph[NMAX];

InputReader _cin("distante.in");

bool test() {
    int n, m, s;
    _cin >> n >> m >> s;

    for (int i = 1; i <= n; ++ i) {
        _cin >> d[i];
        graph[i].clear();
    }

    for (int i = 1; i <= m; ++ i) {
        int a, b, c;
        _cin >> a >> b >> c;

        graph[a].push_back(make_pair(b, c));
        graph[b].push_back(make_pair(a, c));
    }

    if (d[s] != 0)
        return false;

    for (int i = 1; i <= n; ++ i)
        for (auto it: graph[i])
            if (d[i] + it.second < d[it.first])
                return false;
    return true;
}

int main()
{
    freopen("distante.out", "w", stdout);

    int t;
    _cin >> t;

    while (t --)
        if (test())
            cout << "DA\n";
        else
            cout << "NU\n";

    return 0;
}