#include <fstream>
#include <queue>
#include <vector>
#define NM 50005
#define mp make_pair
#define oo 2100000000
using namespace std;
ifstream f("distante.in");
ofstream g("distante.out");
int t,n,m,nod,d[NM],noduri[NM];
bool viz[NM];
vector <pair<int,int> >v[NM];
struct ok
{   bool operator()(int x,int y)
    {   return d[x]>d[y];   }
};
priority_queue <int,vector<int>,ok> coada;
void Read()
{   f>>n>>m>>nod;
    for(int i=1; i<=n; i++) f>>noduri[i];
    while(m--)
    {   int x,y,val;
        f>>x>>y>>val;
        v[x].push_back(mp(y,val));
    }
}
void Dijkstra()
{   for(int i=1; i<=n; i++) d[i]=oo;
    d[nod]=0;
    viz[nod]=1;
    coada.push(nod);
    while(!coada.empty())
    {   int x=coada.top();
        coada.pop();
        viz[x]=0;
        for(unsigned int j=0; j<v[x].size(); j++)
        {   int ndv=v[x][j].first;
            int cost=v[x][j].second;
            if(cost+d[x]<d[ndv])
            {   d[ndv]=cost+d[x];
                if(!viz[ndv])
                {   viz[ndv]=1;
                    coada.push(ndv);
                }
            }
        }
    }
}
void Afisare()
{   bool same=true;
    for(int i=1; i<=n; i++)
       if(d[i]!=noduri[i]) same=false;
    g<<((same) ? "DA\n" : "NU\n");
}
int main()
{   f>>t;
    while(t--)
    {   Read();
        Dijkstra();
        Afisare();
        for(int i=1; i<=n; i++)
        {   v[i].clear();
            viz[i]=0;
        }
    }
    return 0;
}