#include <fstream>
#include <vector>
#include <queue>

using namespace std;
ifstream in("distante.in");
ofstream out("distante.out");
const int N=50001;
const int INF= (1<<30);
vector< pair<int,int> >a[N];
priority_queue< pair<int,int> >h;
int t,n,m,d[N],expect[N];

void citire()
{
    int x,y,c;
    for(int i=1;i<=n;i++)
    {
        in>>expect[i];
        a[i].clear();
    }
    for(int i=0;i<m;i++)
    {
        in>>x>>y>>c;
        a[x].push_back(make_pair(y,c));
        a[y].push_back(make_pair(x,c));
    }
}

void dijkstra(int start)
{
    pair<int,int>p;
    int x,y,c;
    for(int i=1;i<=n;i++)
        d[i]=INF;
    d[start]=0;
    h.push(make_pair(-d[start],start));
    while(!h.empty())
    {
        while(!h.empty() && d[h.top().second]<-h.top().first)
            h.pop();
        if(h.empty())
            return;
        x=h.top().second;
        h.pop();
        for(unsigned i=0;i<a[x].size();i++)
        {
            y=a[x][i].first;
            c=a[x][i].second;
            if(d[x]+c<d[y])
            {
                d[y]=d[x]+c;
                h.push(make_pair(-d[y],y));
            }
        }
    }
}

int main()
{
    int start;
    bool gasit=false;
    in>>t;
    while(t)
    {
        in>>n>>m>>start;
        citire();
        dijkstra(start);
        gasit=false;
        for(int i=1;i<=n;i++)
        {
            if(d[i]!=expect[i])
            {
                out<<"NU"<<'\n';
                gasit=true;
                break;
            }
        }
        if(!gasit)
            out<<"DA"<<'\n';
        t--;
    }
    return 0;
}