#include<fstream>
#include<queue>
#include<vector>
#include<cstring>
#define INF 1<<30
using namespace std;
int t,n,m,s,dist[50001],sol[50001];
bool viz[50001];
vector<pair<int,int> >vec[50001];
queue<int> q;
ifstream fin("distante.in");
ofstream fout("distante.out");

void initializare()
{
    for(int i=1;i<=n;i++)
    {
         vec[i]=vector<pair<int,int> >();
    }
    memset(viz,0,sizeof(viz));

}

void distanteInitiale()
{
    for(int i=1;i<=n;i++)
        dist[i]=INF;
    dist[s]=0;
}

void citire()
{
    int x,y,c;
    fin>>n>>m>>s;
    for(int i=1;i<=n;i++)
    {
        fin>>sol[i];
    }
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        vec[x].push_back(make_pair(y,c));
        vec[y].push_back(make_pair(x,c));
    }
}

void bellman_ford()
{
    int k,nod,cost;
    q.push(s);
    viz[s]=1;
    while(!q.empty())
    {
        k=q.front();
        for(int i=0;i<vec[k].size();i++)
        {
            nod=vec[k][i].first;
            cost=vec[k][i].second;
            if(dist[k]+cost<dist[nod])
            {
                if(viz[i]==0)
                {
                    q.push(i);
                    viz[i]=1;
                }
                dist[nod]=dist[k]+cost;
            }
        }
        q.pop();
        viz[k]=0;
    }

}

void verifica()
{
    for(int i=1;i<=n;i++)
    {
        if(sol[i]!=dist[i])
        {
            fout<<"NU\n";
            return;
        }
    }
    fout<<"DA\n";
}

int main()
{
    fin>>t;
    for(;t>0;t--)
    {
        initializare();
        citire();
        distanteInitiale();
        bellman_ford();
        verifica();
    }
    return 0;
}