#include <fstream>
using namespace std;
ifstream ka("distante.in");
ofstream ki("disante.out");
const int N_MAX = 50000;
int t, n, m, s, a, b, c, distante[N_MAX + 1];
int main()
{
    ka >> t;
    for(int i = 1; i <= t; i++)
    {
        bool bun = true;
        ka >> n >> m >> s;
        for(int j = 1; j <= n; j++)
            ka >> distante[j];
        if(distante[s] != 0)
            bun = false;
        for(int j = 1; j <= m; j++)
        {
            ka >> a >> b >> c;
            if(distante[a] + c < distante[b] || distante[b] + c < distante[a])
                bun = false;
        }
        if(bun)
            ki << "DA";
        else
            ki << "NU";
        ki << '\n';
    }
}