Pagini recente » Borderou de evaluare (job #3124080) | Cod sursa (job #2866007) | Cod sursa (job #1402133)
#include <fstream>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include<cstring>
using namespace std;
ifstream cin("distante.in");
ofstream cout("distante.out");
const int o=50005, inf=999999999;
int a, b, c, S, i, j, L, k, t, n, m, D[o];
int main()
{
cin>>t;
while (t--)
{
cin>>n>>m>>S;
for(i=1; i<=n; ++i) cin>>D[i];
bool u=1;
for(i=1; i<=m; ++i)
{
cin>>a>>b>>c;
if(D[a]+c < D[b] || D[b] + c < D[a])
u=0;
}
if (u) cout<<"DA\n";
else cout<<"NU\n";
}
return 0;
}