#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#define inf 250000
using namespace std;

int n,m,x,y,c,dist[50015],viz[250015],T,distante[50015],s;
vector <pair <int ,int > >v[10015];

priority_queue< pair <int, int > > q;

void dijk()
{

    while (!q.empty())
    {
        int y=q.top().second;
        int c=-q.top().first;
        q.pop();

        for (vector <pair<int ,int > > :: iterator it=v[y].begin();it!=v[y].end();++it)
        {
            if (c+it->second < dist[it->first])
                {
                    dist[it->first]=c+it->second;
                    q.push(make_pair(-dist[it->first],it->first));
                }
        }
    }
}

void read()
{scanf("%d",&T);
for(int i=1;i<=T;i++)
    {scanf("%d%d%d",&n,&m,&s);
    for (int i=1;i<=n;++i)
        if(i!=s)
            dist[i]=inf;
    for(int i=1;i<=n;i++)
        scanf("%d",&distante[i]);
    q.push(make_pair(0,s));
    for (int i=1;i<=m;++i)
    {
        scanf("%d%d%d",&x,&y,&c);
        v[x].push_back(make_pair(y,c));
    }
    dijk();
    int viz1=0;
    for(int i=1;i<=n;i++)
        if(i!=s)
            if(dist[i]!=distante[i])
                viz1=1;
    if(viz1==1)
        printf("NU\n");
    else
        printf("DA\n");
    }
}

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