#include<fstream>
#include<vector>
#include<queue>
#define INF 10000000
using namespace std;
ifstream f("distante.in");
ofstream g("distante.out");
typedef struct nod
{
    int y, cost;
}NOD;
vector <NOD> v[50001];
NOD w;
//queue <int> c;
int n, m, t, s, cost[50001], d[50001], c[50001];
void bmf(int x)
{
    int i, u, p, ok1, poz, prim, ultim;
    for(i=1;i<=n;i++)d[i]=INF;
    d[x]=0;
    prim=ultim=1;
    c[prim]=x;
    while(prim<=ultim)
    {
        p=c[prim];
        ok1=0;
        for(i=0;i<v[p].size();i++)
        {
            if(d[v[p][i].y]>d[p]+v[p][i].cost)
            {
                ok1=1;
                poz=v[p][i].y;
                d[poz]=d[p]+v[p][i].cost;
                c[++ultim]=poz;
            }
        }
        if(!ok1)prim++;
    }
}
void citire()
{
    int i, j, x, y, pret;
    f>>t;
    for(i=1;i<=t;i++)
    {
        f>>n>>m>>s;
        for(j=1;j<=n;j++)f>>cost[j];
        for(j=1;j<=n;j++)v[j].clear();
        for(j=1;j<=m;j++)
        {
            f>>x>>y>>pret;
            w.y=y;
            w.cost=pret;
            v[x].push_back(w);
            w.y=x;
            w.cost=pret;
            v[y].push_back(w);
        }
        bmf(s);
        for(j=1;j<=n;j++)
        {
            if(d[j]!=cost[j])
            {
                g<<"NU"<<'\n';
                break;
            }

        }
        if(j==n+1)g<<"DA"<<"\n";
    }
}

int main()
{
    citire();
    f.close();
    g.close();
    return 0;
}