#include <fstream>
#include <cstring>
#include <vector>
#include <queue>
#include <set>

#define se second
#define fi first

#define INF 1000000000
#define DIM 50005

using namespace std;
class InParser {
private:
    FILE *fin;
    char *buff;
    int sp;

    char read_ch() {
        ++sp;
        if (sp == 4096) {
            sp = 0;
            fread(buff, 1, 4096, fin);
        }
        return buff[sp];
    }

public:
    InParser(const char* nume) {
        fin = fopen(nume, "r");
        buff = new char[4096]();
        sp = 4095;
    }

    InParser& operator >> (int &n) {
        char c;
        while (!isdigit(c = read_ch()) && c != '-');
        int sgn = 1;
        if (c == '-') {
            n = 0;
            sgn = -1;
        } else {
            n = c - '0';
        }
        while (isdigit(c = read_ch())) {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }
} f ("distante.in");

class OutParser {
private:
    FILE *fout;
    char *buff;
    int sp;

    void write_ch(char ch) {
        if (sp == 50000) {
            fwrite(buff, 1, 50000, fout);
            sp = 0;
            buff[sp++] = ch;
        } else {
            buff[sp++] = ch;
        }
    }


public:
    OutParser(const char* name) {
        fout = fopen(name, "w");
        buff = new char[50000]();
        sp = 0;
    }
    ~OutParser() {
        fwrite(buff, 1, sp, fout);
        fclose(fout);
    }

    OutParser& operator << (int vu32) {
        if (vu32 <= 9) {
            write_ch(vu32 + '0');
        } else {
            (*this) << (vu32 / 10);
            write_ch(vu32 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (char ch) {
        write_ch(ch);
        return *this;
    }
    OutParser& operator << (const char *ch) {
        while (*ch) {
            write_ch(*ch);
            ++ch;
        }
        return *this;
    }
} g ("distante.out");

int c[DIM] , d[DIM];
int n , m , s;

vector <vector <pair <int , int> > > G;

class comp {
public:
    bool operator()(int& t1, int& t2){
       return c[t1] > c[t2];
    }
};priority_queue <int, std :: vector<int> , comp> coada;

void solve () {
    int a , b , cst;
    f >> n >> m >> s;

    G.clear();
    G.resize (n + 2);

    for (int i = 1; i <= n; ++i) {
        f >> d[i];
        c[i] = INF;
    }

    for (int i = 1; i <= m; ++i) {
        f >> a >> b >> cst;

        G[a].push_back (make_pair (b , cst));
        G[b].push_back (make_pair (a , cst));
    }

    while (!coada.empty()) {
        coada.pop();
    }

    coada.push(s);
    c[s] = 0;

    while (!coada.empty ()) {
        int x = coada.top();
        coada.pop ();

        for (vector <pair <int , int> > :: iterator it = G[x].begin(); it != G[x].end(); ++it) {
            int y = (*it).fi;
            int aux = c[x] + (*it).se;

            if (aux < c[y]) {
                c[y] = aux;
                if (c[y] < d[y]) {
                    g << "NU\n";
                    return;
                }

                coada.push (y);
            }
        }
    }

    for (int i = 1; i <= n; ++i) {
        if (c[i] != d[i]) {
            g << "NU\n";
            return;
        }
    }

    g << "DA\n";
}

int main() {
    int T;
    f >> T;

    while (T--) {
        solve ();
    }
    return 0;
}