#include <iostream>
#include<bits/stdc++.h>

using namespace std;
int n,m,x,y,a,b,i,j,v[100005],rad,cod;
int radacina(int x)
{
while(v[x]!=0)x=v[x];
return x;
}
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int main()
{
    f>>n>>m;
    for(i=1; i<=m; i++)
    {
        f>>cod;
        f>>x>>y;
        if(cod==1)
        v[radacina(x)]=radacina(y);
        if(cod==2)
        {

if(radacina(x)==radacina(y))g<<"DA"<<"\n";
          else g<<"NU"<<"\n";
        }

    }

}