#include <fstream>
#define NMAX 100002
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int tata[NMAX], n, h[NMAX], m, op; ///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 t1, t2, i, a, b;
    fin>>n;
    for (i=1; i<=n; i++)
    {
        tata[i]=i;
        h[i]=1;
    }
    fin>>m;
    for (i=1;i<=m;i++)
    {
        fin>>op>>a>>b;
        t1=Find(b);
        t2=Find(a);
        if (op==1)
            Union(t1, t2);
           else
        {
            if (t1==t2)
                fout<<"DA"<<'\n';
            else
                fout<<"NU"<<'\n';
        }
    }
    return 0;
}