#include <bits/stdc++.h>
#define fi first
#define sc second
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;
	}
}f("distante.in");
ofstream g("distante.out");
int q, n, m, S, B[50001], x, y, z;
bool viz[50002];
int dis[50001];
vector<pair<int, int>>v[50001];
set<pair<int, int>>s;
void dfs(int nod)
{
    viz[nod]=1;
    for(int i=0; i<v[nod].size(); i++)
    {
        if(!viz[v[nod][i].fi])
        {
            viz[v[nod][i].fi]=1;
            s.insert(make_pair(v[nod][i].sc+dis[nod], v[nod][i].fi));
            dis[v[nod][i].fi]=v[nod][i].sc+dis[nod];
        }
        else
        {
            if(v[nod][i].sc+dis[nod]<dis[v[nod][i].fi])
            {
                s.erase(make_pair(dis[v[nod][i].fi], v[nod][i].fi));
                dis[v[nod][i].fi]=v[nod][i].sc+dis[nod];
                s.insert(make_pair(v[nod][i].sc+dis[nod], v[nod][i].fi));
            }
        }
    }
}
int main()
{
    f>>q;
    for(; q; q--)
    {
        bool ok=1;
        memset(viz, 0, sizeof(viz));
        memset(dis, 0, sizeof(dis));
        s.clear();
        f>>n>>m>>S;
        for(int i=1; i<=n; i++)
            v[i].clear();
        for(int i=1; i<=n; i++)
            f>>B[i];
        for(int i=1; i<=m; i++)
        {
            f>>x>>y>>z;
            v[x].push_back(make_pair(y, z));
            v[y].push_back(make_pair(x, z));
        }
        s.insert(make_pair(0, S));
        while(!s.empty())
        {
            int a=(*s.begin()).sc;
            if(dis[a] != B[a])
                break;
            s.erase(s.begin());
            dfs(a);
        }
        for(int i=1; i<=n; i++)
            if(dis[i]!=B[i])
            {
                i=n+1;
                ok=0;
                g<<"NU";
            }
        if(ok==1)
            g<<"DA";
        g<<'\n';
    }
    return 0;
}