#include <fstream>
#include <stdio.h>
#include <ctype.h>
#include <vector>
#include <queue>
#include <bitset>

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;
    }
    
    InParser& operator >> (long long &n) {
        char c;
        n = 0;
        while (!isdigit(c = read_ch()) && c != '-');
        long long 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;
    }
};

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 << (long long vu64) {
        if (vu64 <= 9) {
            write_ch(vu64 + '0');
        } else {
            (*this) << (vu64 / 10);
            write_ch(vu64 % 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;
    }
};

InParser in("distante.in");
OutParser out("distante.out");

const int NMAX = 50000;
const int INF = 1e9;

int d[NMAX],d1[NMAX];
int n,m,s;

vector <pair<int,int>> G[NMAX];
bitset<NMAX> viz;
priority_queue<pair<int,int>> pq;

void dijkstra(int s)
{
    for(int i = 1; i <= n; i++)
    {
        d[i] = INF;
    }
    d[s] = 0;
    pq.push({-d[s],s});
    while(!pq.empty())
    {
        int x = pq.top().second;
        pq.pop();
        if(viz[x])
        {
            continue;
        }
        viz[x] = true;
        for(auto p : G[x])
        {
            int y = p.first;
            int c = p.second;
            if(d[x] + c < d[y])
            {
                d[y] = d[x] + c;
                pq.push({-d[y],y});
            }
        }
    }
}

int main(int argc, const char * argv[])
{
    int t;
    in >> t;
    while(t--)
    {
        in >> n >> m >> s;
        for(int i = 1; i <= n; i++)
        {
            in >> d1[i];
        }
        for(int i = 0; i < m; i++)
        {
            int x,y,c;
            in >> x >> y >> c;
            G[x].push_back({y,c});
            G[y].push_back({x,c});
        }
        dijkstra(s);
        bool este_corect = true;
        for(int i = 1; i <= n; i++)
        {
            if(d1[i] != d[i])
            {
                este_corect = false;
                break;
            }
        }
        for(int i = 1; i <= n; i++)
        {
            G[i].clear();
        }
        viz.reset();
        if(este_corect)
        {
            out << "DA" << '\n';
        }
        else
        {
            out << "NU" << '\n';
        }
    }
    return 0;
}