program disjoint;
const MAX_N = 100000;
var n, m : longint;
    t : array[1..MAX_N] of longint;
    i, op, a, b : longint;

procedure union(a, b : longint);
begin
    t[a] := b;
end;

function find(a : longint) : longint;
begin
    if t[a] <> a then find := find(t[a]);
    find := a;
end;

// main function starts here
begin
    assign(input, 'disjoint.in'); reset(input);
    assign(output, 'disjoint.out'); rewrite(output);

    read(n, m);
    // initialization
    for i := 1 to n do
        t[i] := i;

    // solve
    for i := 1 to m do
    begin
        read(op, a, b);
        if op = 1 then union(find(a), find(b))
        else
            if find(a) = find(b) then
                writeln('DA')
            else
                writeln('NU');
    end;
end.