#include <bits/stdc++.h>

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;
	}
};
const int NMAX(50005);
int d[NMAX], dist[NMAX], a, b, c, n, m, st, nod, newC, i;
bool viz[NMAX], ok;
vector<pair<int, int> > G[NMAX];
set<pair<int, int> > s;
InParser fin("distante.in");
int main()
{
    freopen("distante.out", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    int t;
    fin >> t;
    while(t--)
    {
        fin >> n >> m >> st;
        for(i = 1; i <= n; ++i)
        {
            fin >> d[i];
            G[i].clear();
            dist[i] = (1 << 30);
            viz[i] = 0;
        }
        for(i = 1; i <= m; ++i)
        {
            fin >> a >> b >> c;
            G[a].push_back({b, c});
            G[b].push_back({a, c});
        }
        s.clear();
        s.insert({0, st});
        dist[st] = 0;
        while(!s.empty())
        {
            nod = s.begin()->second;
            s.erase(s.begin());
            viz[nod] = 1;
            for(auto it: G[nod])
                if(!viz[it.first])
                {
                    newC = dist[nod] + it.second;
                    if(newC < dist[it.first])
                    {
                        if(dist[it.first] != (1 << 30))
                            s.erase(s.find({dist[it.first], it.first}));
                        dist[it.first] = newC;
                        s.insert({newC, it.first});
                    }
                }
        }
        ok = 1;
        for(i = 1; i <= n; ++i)
            if(d[i] != dist[i])
            {
                ok = 0;
                break;
            }
        cout << (ok == 1? "DA\n" : "NU\n");
    }
    return 0;
}