#include <fstream>

using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int a[100005],n,m,i,p,x,y;
void reuneste()
{
    while(a[x]>0)
        x=a[x];
    while(a[y]>0)
        y=a[y];
    if(x!=y)
    {
        a[y]+=a[x];
        a[x]=y;
    }
}
void verifica()
{
    while(a[x]>0)
        x=a[x];
    while(a[y]>0)
        y=a[y];
    if(y==x)
        fout<<"DA\n";
    else
        fout<<"NU\n";
}
int main()
{
    fin>>n>>m;
    for(i=1;i<=n;i++)
        a[i]=-1;
    for(i=1;i<=m;i++)
    {
        fin>>p>>x>>y;
        if(p==1)
            reuneste();
        else
            verifica();
    }
    return 0;
}