#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
using namespace std;

#define inf 0x3f3f3f3f

const int maxn = 50001;

int n, m, s;
int bronz[maxn];

int d[maxn];
int inq[maxn];

vector<pair<int,int> > g[maxn];

void read()
{
    scanf("%d%d%d", &n, &m, &s);
    for (int i = 1; i <= n; ++i) scanf("%d", &bronz[i]);
    for (int i = 1; i <= m; ++i)
    {
	int x, y, c; scanf("%d%d%d", &x, &y, &c);
	g[x].push_back(make_pair(y,c));
	g[y].push_back(make_pair(x,c));
    }

}

void bellman()
{
    queue<int> Q;
    Q.push(s); d[s] = 0; inq[s] = 1;

    while (!Q.empty())
    {
	int akt = Q.front();
	Q.pop();
	for (int i = 0; i < g[akt].size(); ++i)
	{
	    int next = g[akt][i].first;
	    int cost = g[akt][i].second;
	    if (d[next] > d[akt] + cost)
	    {
		d[next] = d[akt] + cost;
		if (!inq[next])
		{
		    Q.push(next);
		    inq[next] = 1;
		}
	    }
	}
	inq[akt] = 0;
    }
}

int solve()
{
    bellman(); 
    for (int i = 1; i <= n; ++i)
	if (d[i] != bronz[i]) return 0;
    return 1;
}

int main()
{
    freopen("distante.in","r",stdin);
    freopen("distante.out","w",stdout);

    int T;
    for(scanf("%d", &T); T; --T)
    {
	for (int i = 1; i <= n; ++i) g[i].clear();
	memset(d, 0x3f, sizeof(d));
	read();
	printf("%s\n", solve() ? "DA" : "NU");
    }

    return 0;
}