#include <fstream>
#define inf 1e9
#define f first
#define s second
#include <queue>
#include <vector>
#include <cstring>
using namespace std;
ifstream in ("distante.in");
ofstream out ("distante.out");
vector<pair<int,int> > v[50001];
priority_queue<pair<int,int>, vector<pair<int,int> >, greater<pair<int,int> > > h;
int n,m,g,viz[50001],d[50001],a,b,c,varf,sol[50001],ok=0;
void dijsktra(int varf)
{

for(int i=1;i<=n;i++)
    d[i]=inf;
    d[varf]=0;
    h.push({0,varf});
    while(!h.empty())
    {
        int nod=h.top().s;
        h.pop();
        if(viz[nod]==0)
        {
            for(int i=0;i<v[nod].size();i++)
            {
                if(d[v[nod][i].s]>d[nod]+v[nod][i].f)
                {
                    d[v[nod][i].s]=d[nod]+v[nod][i].f;
                    h.push({d[v[nod][i].s],v[nod][i].s});
                }
            }
            viz[nod]=1;
        }
    }
}
int main()
{
    int t;
    in>>t;
    for(int g=1;g<=t;g++)
    {

        in>>n>>m>>varf;
        for(int j=1;j<=n;j++)in>>sol[j];
        for(int i=1;i<=m;i++)
        {in>>a>>b>>c;
        v[a].push_back({c,b});
        v[b].push_back({c,a});
        }
        dijsktra(varf);
        for(int i=1;i<=n;i++)
        {
            if(sol[i]!=d[i]){ok=1;out<<"NU"<<'\n';break;}
        }
        if(ok==0)out<<"DA"<<'\n';
        ok=0;
    for(int i=1;i<=n;i++)
   {
      v[i].clear();
      viz[i]=0;
   }
    }

    return 0;
}