#include <fstream>

using namespace std;

ifstream fin ("disjoint.in");
ofstream fout ("disjoint.out");

unsigned int FATHER (unsigned int node);

unsigned int N, M;
unsigned int code, x, y;

unsigned int tree[100001];
unsigned int X, Y;
unsigned int i;

int main ()
{
    fin >> N >> M;
    for (i=1; i<=M; i++)
    {
        fin >> code >> x >> y;
        X = FATHER(x);
        Y = FATHER(y);
        if (code == 1)
            tree[Y] = X;
        else
            if (X == Y)
                fout << "DA\n";
            else
                fout << "NU\n";
    }
    return 0;
}

unsigned int FATHER (unsigned int node)
{
    if (node == tree[node])
        return node;
    return FATHER(tree[node]);
}