#include <fstream>
#include <queue>

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;
    }
};
priority_queue <pair<int, int> > q;
vector <int> v[50005],co[50005];
int best[50005],sol[50005];
int main()
{
	ifstream fin("distante.in");
	ofstream fout("distante.out");

    int t,n,m,s,a,b,c,ok=0;
    pair <int, int> pa,ca;
    fin>>t;

    for(int k=0;k<t;k++)
	{
		fin>>n>>m>>s;
		for(int h=1;h<=n;h++)
		{
			fin>>sol[h];
			v[h].clear();
			co[h].clear();
			best[h]=-1000000;
		}
		for(int h=1;h<=m;h++)
		{
			fin>>a>>b>>c;
			v[a].push_back(b);
			co[a].push_back(c);
			v[b].push_back(a);
			co[b].push_back(c);
		}

		pa.first=0;
		pa.second=s;
		best[s]=0;
		q.push(pa);
		while(!q.empty())
		{
			pa=q.top();
			q.pop();
			if(pa.first==best[pa.second])
			{
				for(int i=0;i<v[pa.second].size();i++)
				{
					ca.first=co[pa.second][i]*(-1)+pa.first;
					ca.second=v[pa.second][i];
					if(ca.first>best[ca.second])
					{
						best[ca.second]=ca.first;
						q.push(ca);
					}
				}
			}
		}

		ok=0;
		for(int i=1;i<=n;i++)
		{
			if(best[i]==-1000000)
				best[i]=0;
			if(sol[i]!=best[i]*(-1))
			{
				ok=1;
				break;
			}
		}
		if(ok==1)
			fout<<"NU"<<'\n';
		else
			fout<<"DA"<<'\n';
	}

    return 0;
}