#include<fstream>
#define dmax 100003

using namespace std;

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

int n, m;

int father[dmax];
int rank[dmax];

void join(int a, int b)
{
    while(father[a] != -1)
        a = father[a];

    while(father[b] != -1)
        b = father[b];

    if(rank[a] > rank[b])
    {
        father[b] = a;
    }
    else if(rank[b] > rank[a])
    {
        father[a] = b;
    }
    else
    {
        father[b] = a;
        rank[a] ++;
    }
}


void query(int a, int b)
{
    while(father[a] != -1)
        a = father[a];

    while(father[b] != -1)
        b = father[b];

    if(a == b)
    {
        out<<"DA\n";
    }
    else out<<"NU\n";
}




int main()
{
    in>>n>>m;

    for(int i=1; i<=n; i++)
    {
        rank[i] = 1;
        father[i] = -1;
    }

    for(int i=1; i<=m; i++)
    {
        int op, a, b;

        in>>op>>a>>b;

        if(op == 1)
            join(a, b);
        else query(a, b);
    }

    in.close();
    out.close();

    return 0;
}