#include <bits/stdc++.h>
#define NMAX 50005
#define inf 0x3f3f3f3f
using namespace std;
ifstream f("distante.in");
ofstream g("distante.out");
typedef pair <int, int> ion;
int n,m,t,sursa,bronzarel[NMAX],dist[NMAX];
vector<ion> a[NMAX];
struct compare
{
    bool operator() (const ion &a,const ion &b) const
    {
        return a.second>b.second;
    }
};
priority_queue <ion, vector<ion>, compare> q;
void read()
{
    int x,y,D;
    f>>n>>m>>sursa;
    for(int i=1; i<=n; i++)f>>bronzarel[i];
    for(int i=1; i<=m; i++)
    {
        f>>x>>y>>D;
        a[x].push_back(ion(y,D));
        a[y].push_back(ion(x,D));
    }
}
void dijkstra()
{
    for(int i=1;i<=n;i++)dist[i]=inf;
    dist[sursa]=0;
    q.push(ion(sursa,0));
    while(!q.empty())
    {
        ion aux=q.top();
        q.pop();
        int node=aux.first,cost=aux.second;
        if(cost>dist[node])continue;
        for(vector<pair<int,int> >::iterator it=a[node].begin();it!=a[node].end();++it)
        {
            int node2=it->first,cost2=it->second;
            if(dist[node2]==inf||dist[node2]>dist[node]+cost2)
            {
                dist[node2]=dist[node]+cost2;
                q.push(ion(node2,dist[node2]));
            }
        }
    }
    for(int i=1;i<=n;i++)if(dist[i]==inf)dist[i]=0;
}
void CLEAR()
{
    for(int i=1;i<=n;i++)
        a[i].clear();
}
void solve()
{
    f>>t;
    for(int k=1; k<=t; k++)
    {
        read();
        dijkstra();
        int okay=0;
        for(int i=1;i<=n;i++)
            if(dist[i]!=bronzarel[i])
        {
            g<<"NU"<<'\n';
            okay=1;
            break;
        }
        if(okay==0)
            g<<"DA"<<'\n';
        CLEAR();
    }
}
int main()
{
    solve();
    return 0;
}