#include <fstream>
#define NMAX 100002

using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");

int tata[NMAX];
int h[NMAX]; ///h[i]=inaltimea arb cu rad. i
void Union(int x, int y);
int Find(int x);


int main()
{int n, m, c, x, y, i;

    fin >> n >> m;
    for(i=1; i<=n; i++) tata[i]=i;
    for(i=1; i<=m; i++)
       {
         fin >> c >> x >> y;
         int r1=Find(x);
         int r2=Find(y);
         if(c==1)
            Union(r1,r2);
         else
            {
              if(r1==r2) fout << "DA" << '\n';
              else fout << "NU" << '\n';
            }
       }
    return 0;
}


void Union(int x, int y)
{
    if(h[x]<h[y]) tata[x]=y;
    else
        if(h[x]>h[y]) tata[y]=x;
    else ///inaltimile sunt egale
        tata[y]=x, h[x]++;
}


int Find(int x)
{int r, y;
    ///mai intai aflu rad arb din care face parte x
    r=x;
    while(tata[r]!=r) r=tata[r];
    ///parcurg din nou drumul de la x la r si fac toate nodurile fii ai lui r
    do {
         y=tata[x];
         tata[x]=r;
         x=y;
       }
    while(tata[x]!=r);
    return r;
}


int findd(int x)
{
    if(tata[x]==0) return x;
    tata[x]=findd(tata[x]);
    return tata[x];
}