#include <bits/stdc++.h>
#define NMAX 50005
#define inf 1<<30
#define price first
#define node second
using namespace std;
ifstream f("distante.in");
ofstream g("distante.out");
int n,m,t,sursa,d[NMAX],dist[NMAX];
vector<pair<int,int> > a[NMAX];
set<pair<int,int> > heap;
void read()
{
    int x,y,D;
    f>>n>>m>>sursa;
    for(int i=1; i<=n; i++)f>>d[i];
    for(int i=1; i<=m; i++)
    {
        f>>x>>y>>D;
        a[x].push_back(make_pair(D,y));
        a[y].push_back(make_pair(D,x));
    }
}
void CLEAR()
{
    for(int i=1;i<=n;i++)
        a[i].clear();
}
void solve()
{
    f>>t;
    for(int k=1; k<=t; k++)
    {
        read();
        for(int i=1; i<=n; i++)dist[i]=inf;
        dist[sursa]=0;
        heap.insert(make_pair(0,sursa));
        while(!heap.empty())
        {
            int node=heap.begin()->node;
            heap.erase(heap.begin());
            for(vector<pair<int,int> >::iterator it=a[node].begin(); it!=a[node].end(); ++it)
            {
                int node2=it->node,dist2=it->price;
                if(dist[node2]>dist[node]+dist2)
                {
                    if(dist[node2]!=inf)
                        heap.erase(heap.find(make_pair(dist[node2],node2)));
                    dist[node2]=dist[node]+dist2;
                    heap.insert(make_pair(dist[node2],node2));
                }
            }
        }
        int ok=0;
        for(int i=1; i<=n; i++)
            if(dist[i]!=d[i])
            {
                g<<"NU\n";
                ok=1;
                break;
            }
        if(ok==0)
            g<<"DA\n";
        CLEAR();
    }
}
int main()
{
    solve();
    return 0;
}