Pagini recente » Cod sursa (job #2990233) | Cod sursa (job #1584277) | Cod sursa (job #2385306) | Cod sursa (job #2430803) | Cod sursa (job #1500809)
#include <stdio.h>
using namespace std;
const int N = 50005;
int main()
{
int n, m, start, T;
int a[N];
bool ok;
freopen("distante.in", "r", stdin);
freopen("distante.out", "w", stdout);
scanf("%d", &T);
for (; T--;)
{
ok = true;
scanf("%d %d %d", &n, &m, &start);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
if (a[start]) ok = false;
for (int i = 1, a1, b, c; i <= m; i++)
{
scanf("%d %d %d", &a1, &b, &c);
ok &= !(a[a1] + c < a[b] || a[b] + c < a[a1]);
}
if (ok) printf("DA\n");
else printf("NU\n");
}
return 0;
}