#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m,tip,x,y;
int sef[100001];

int sef_suprem(int z)
{
    if(sef[z]==z) return z;
    return sef[z]=sef_suprem(sef[z]);
}

int unire( int x, int y)
{
    int a,b;
    a=sef_suprem(x);
    b=sef_suprem(y);
    sef[a]=b;
}

int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;i++)
        sef[i]=i;
    for(int i=1;i<=m;i++)
    {
        fin>>tip>>x>>y;
        if(tip==1)
            unire(x,y);
        else
        {
            if(sef_suprem(x)==sef_suprem(y)) fout<<"DA";
            else fout<<"NU";
            fout<<'\n';
        }
    }
    return 0;
}