#include <stdio.h>
#include <fstream>
#include <iostream>
#include <vector>
#include <queue>
#define NMAX 50005
#define INT_MAX 500000000
using namespace std;

struct edge
{
    int nod;
    int cost;
    edge *next;
};

void add(edge **a, int cost, int from,int where)
{
    edge * p = new edge();
    p->cost = cost;
    p->nod = where;
    p->next = a[from];
    a[from] = p;
}

class Compare
{
    public:
        bool operator() (pair<int, int> a, pair<int, int> b) {
        return b.second < a.second;
    }
};

int djikstra(int x0, int *d, int *dist,int n, edge **a)
{

    for(int i = 1; i <=n; ++i)
        d[i] = INT_MAX;

    priority_queue<pair<int, int>, vector< pair<int,int> >, Compare> q;

    d[x0] = 0;
    q.push(make_pair(x0,0));

    for(int i=1;i<=n;i++)
    {
        pair<int, int> min = q.top();
        q.pop();

        edge *p = a[min.first];
        while(p!= NULL)
        {
            if(d[p->nod] > min.second + p->cost)
            {
                d[p->nod] = min.second + p->cost;
                q.push(make_pair(p->nod,d[p->nod]));
            }
            p = p->next;
        }
    }

    for(int i = 1; i<= n ;i++)
        if(d[i] != dist[i])
            return 0;
    return 1;
}

int main(void)
{
    int t,n,m,s;
    int d[NMAX];
    int dist[NMAX];
    edge *a[NMAX];

    std::ifstream f("distante.in");
    f>>t;
    std::ofstream g("distante.out");

    for(int j = 0; j<t;++j)
    {
        f>>n>>m>>s;

        for(int i = 1;i <= n; ++i)
            f>>dist[i];

        for(int i = 0;i<=n;i++)
            a[i] = NULL;

        for(int i = 1;i<=m; ++i)
        {
            int x,y,z;
            f>>x>>y>>z;
            add(a,z,x,y);
            add(a,z,y,x);

        }

        if( djikstra(s ,d,dist,n,a) )
            g<<"DA\n";
        else
            g<<"NU\n";


    }
    return 0;
}