#include <fstream>

std::ifstream in { "distante.in" };
std::ofstream out { "distante.out" };
int d[50001];

bool read_and_check_graph() {
    int nodes;
    int edges;
    int source;
    in >> nodes >> edges >> source;

    for (int node = 1; node <= nodes; node++)
        in >> d[node];

    for (int edge = 1; edge <= edges; edge++) {
        int node1;
        int node2;
        int cost;
        in >> node1 >> node2 >> cost;

        if (d[node1] + cost < d[node2] || d[node2] + cost < d[node1])
            return false;
    }

    if (d[source])
        return false;
    return true;
}

int main() {
    int graph_count;
    in >> graph_count;

    for (int graph = 0; graph < graph_count; graph++)
        out << (read_and_check_graph() ? "DA\n" : "NU\n");
}