#include <iostream>
#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
struct nod
{
    int gr,p;
    //nod *p;

}v[100050];
//nod *v[100050];
int n, m;
void arbore1 (int x)
{
    //x->p=x;
   // x->gr=0;
   v[x].p=x;
}
void link (int x, int y)
{
    if(v[x].gr> v[y].gr)
        v[y].p=x;
    else
        {   v[x].p=y;
            if(v[x].gr == v[y].gr)
                v[y].gr++;
        }
}
int radacina (int x)
{
    if(x != v[x].p)
        v[x].p=radacina(v[x].p);
    return v[x].p;
}
void unire(int x, int y)
{
    link(radacina(x),radacina(y));
}
void citire ()
{
    f>>n>>m;
    int i, x, y, op;
    for(i=1;i<=n;++i)
        arbore1(i);
    while(m--)
    {
        f>>op>>x>>y;
        if(op==1)
            unire(x,y);
        else
            if(radacina(x)==radacina(y))  g<<"DA"<<endl;
            else g<<"NU"<<endl;
    }
    f.close();
    g.close();
}
int main()
{
    citire();
}