#include <iostream>
#include <fstream>
#define DN 100001

using namespace std;

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

int n, m, rang[DN], tata[DN];

int get_rad(int x)
{
    int rad, y;
    //merg pe arbore pana gasesc un nod care pointeaza la el insusi ( radacina )
    for( rad = x; tata[rad]!= rad; rad=tata[rad] );
    //compresia drumurilor
    while(tata[x]!=x)
    {
        y=tata[x];
        tata[x]=rad;
        x=y;
    }
    return rad;
}
void unite(int x, int y)
{
    //unesc multimea cu rang mai mic de cea cu rang mai mare
    if(rang[x]>rang[y])
        tata[y]=x;
    else tata[x]=y;
    if(rang[x]==rang[y])
        rang[y]++;
}
int main()
{
    f>>n>>m;
    for(int i=1; i<=n; i++)
    {
        tata[i]=i;
        rang[i]=1;
    }
    for(int i=1; i<=m; i++)
    {
        int cod, x, y;
        f>>cod>>x>>y;
        if(cod==2)
        {
            //se verifica daca radacina arborelui in care se afla x si y este egala
            if(get_rad(x)==get_rad(y))
                g<<"DA"<<'\n';
            else g<<"NU"<<'\n';
        }
        else //unesc radacinile celor doua numere
        {
            unite(get_rad(x), get_rad(y));
        }

    }
    return 0;
}