#include <bits/stdc++.h>
using namespace std;

int t, n, m, s;
int d[50005];
inline void solve(){
    scanf("%d%d%d", &n, &m, &s);
    for(int i = 1; i <= n ; ++i) scanf("%d", &d[i]);
    int x, y, z, ok = 0;
    for(int i = 1; i <= m ; ++i){
        scanf("%d%d%d", &x, &y, &z);
        if(d[x] + z < d[y] || d[y] + z < d[x]) ok = 1;
    }
    if(ok == 1) printf("NU\n");
    else printf("DA\n");
}
int main()
{
    freopen("distante.in", "r", stdin);
    freopen("distante.out", "w", stdout);
    scanf("%d", &t);
    while(t--) solve();
    return 0;
}