#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream in("distante.in");
ofstream out("distante.out");
const int MAXN = 50005;
vector<int> vecini[MAXN];
vector<int> cost[MAXN];
struct nod_dijk
{
int nod, dist;
bool operator < (const nod_dijk &b) const
{
return dist > b.dist;//heap de maxime
}
};
priority_queue<nod_dijk> heap;
int n;
int d[MAXN];
bool dijkstra(int start)
{
if (d[start] != 0)
return false;
heap.push((nod_dijk){start, 0});
while(!heap.empty())
{
int nod = heap.top().nod;
int dist = heap.top().dist;
heap.pop();
if (d[nod] != dist)
continue;
for (unsigned int i = 0;i < vecini[nod].size();++i)
{
int vecin = vecini[nod][i];
int c = cost[nod][i];
if (d[nod] + c < d[vecin])
return false;
if (d[nod] + c == d[vecin])
heap.push((nod_dijk){vecin, d[vecin]});
}
}
return true;
}
bool test()
{
int start, m;
in >> n >> start >> m;
for (int i = 1;i <= n;++i)
in >> d[i];
while(m > 0)
{
int a,b,c;
in >> a >> b >> c;
vecini[a].push_back(b);
vecini[b].push_back(a);
cost[a].push_back(c);
cost[b].push_back(c);
--m;
}
return dijkstra(start);
}
int main()
{
int t;
in >> t;
while(t > 0)
{
bool b = test();
if (b)
out << "DA\n";
else out << "NU\n";
for (int i = 1;i <= n;++i)
{
vecini[i].clear();
cost[i].clear();
}
while(!heap.empty())
heap.pop();
--t;
}
return 0;
}