#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int T[100001];//vectorul de tati(T[] )
int i,n,m,x,y,op,RT[100001];;
int rad(int x)
{
    int r, y;
    r=x;                 //merg in sus pe arbore pana gasesc radacina
    while(T[r]!=0)r=T[r];// un nod cu tata 0)

    while(T[x]!=0)     //aplic compresia drumurilor
      {  y = T[x]; T[x] = r;  x = y;  }
    return r; //returnez radacina
}
void reuneste( int x,int y)
{
    if(RT[x]>RT[y]) T[y]=x;     //unesc multimea cu rang mai mic de cea cu rang mai mare
    else T[x]=y;
    if(RT[x]==RT[y]) RT[y]++;   //in caz ca rangurile erau egale atunci cresc
}                               //rangul noii multimi cu 1

int main()
{
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>op>>x>>y;
        if (op==2) { if(rad(x)==rad(y)) g<<"DA\n";
                    else g<<"NU\n";}
        else reuneste(rad(x),rad(y));
    }
    return 0;
}