#include <iostream>
#include <fstream>

using namespace std;
ifstream f ("disjoint.in");
ofstream g ("disjoint.out");
int n, m, p, x, y;
struct tree
{
    int tata, rang;
};
tree multime[105];
int findtata(int x)
{
    while(multime[x].tata!=x)
        x=multime[x].tata;
    return x;
}
void reuniune(int x, int y)
{
    int aux=findtata(x);
    int auy=findtata(y);
    if(multime[aux].rang <multime[auy].rang)
        multime[aux].tata=auy;
    if(multime[auy].rang <multime[aux].rang)
        multime[auy].tata=aux;
    if(multime[aux].rang==multime[auy].rang)
    {
        multime[aux].tata=auy;
        multime[auy].rang++;
    }
}
void compresie(int x, int tatax)
{
    while(x != tatax)
    {
        int aux=multime[x].tata;
        multime[x].tata=tatax;
        x=aux;
    }
}
int main()
{
    f>>n>>m;
    for(int i=1; i<=n; i++)
    {
        multime[i].rang=1;
        multime[i].tata=i;

    }
    for(int i=1; i<=m; i++)
    {
        f>>p>>x>>y;
        if(p==1)
            reuniune(x, y);
        if(p==2)
        {
            int tatax=findtata(x);
            int tatay=findtata(y);
            compresie(x,tatax);
            compresie(y,tatay);
            if(tatax==tatay)
                g<<"DA"<<'\n';
            else
                g<<"NU"<<'\n';

        }
    }
    return 0;
}