#include <fstream>
#define NMAX 100002
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int tata[NMAX], n, h[NMAX], m, c; //h[i]=inaltimea arborelui cu rad i
void Union(int x, int y)
{
    if(h[x]<h[y])
    {
        tata[x]=y;
    }
    else if(h[y]<h[x])
    {
        tata[y]=x;
    }
    else //inaltimile sunt egale
    {
        tata[y]=x;
        h[y]++;
    }
}
int Find(int x)
{
  ///mai intai aflu rad arb din care e x
    int r=x,y;
    while(tata[r]!=r) r=tata[r];
    ///parcurg iar de la x la r si frac toate nodurile fii a lui r
    do
    {
        y=tata[x];
        tata[x]=r;
        x=y;
    } while(tata[x]!=r);

    return tata[x];
}
int main()
{
    int i, a, b;
    fin>>n>>m;
    for(i=1;i<=n;i++)
    {
        tata[i]=i;
        //h[i]=1;
    }
    for(i=1; i<=m; i++)
    {
        fin>>c>>a>>b;
        if(c==1) Union(a, b);
        else
        {
           if(Find(a)==Find(b)) fout<<"DA\n";
           else fout<<"NU\n";
        }

    }

    return 0;
}