Pagini recente » Cod sursa (job #1787510) | Cod sursa (job #846088) | Cod sursa (job #1779282) | Cod sursa (job #2424381) | Cod sursa (job #660027)
Cod sursa(job #660027)
#include <cstdio>
#define NMax 50005
using namespace std;
int N, M, S, D[NMax];
void Solve ()
{
scanf ("%d %d %d", &N, &M, &S);
for (int i=1; i<=N; ++i)
{
scanf ("%d", &D[i]);
}
bool V=true;
if (D[S]!=0)
{
V=false;
}
for (; M>0; --M)
{
int X, Y, C;
scanf ("%d %d %d", &X, &Y, &C);
if (D[X]+C<D[Y])
{
V=false;
}
}
if (V)
{
printf ("DA\n");
}
else
{
printf ("NU\n");
}
}
int main()
{
freopen ("distante.in", "r", stdin);
freopen ("distante.out", "w", stdout);
int T;
scanf ("%d", &T);
for (; T>0; --T)
{
Solve ();
}
return 0;
}