#include <iostream>
#include <fstream>

using namespace std;

int t[100001];

int root (int k)
{
    if (t[k]==k)
        return k;
    else
        return t[k]=root(t[k]);
}

int main()
{
    int N, M, X, Y, i, cod;
    ifstream f("disjoint.in");
    ofstream g("disjoint.out");
    f>>N>>M;
    for (i=1; i<=N; i++)
         t[i]=i;
    for (i=1; i<=M; ++i)
        {f>>cod>>X>>Y;
         if (cod==1)
             t[root(Y)]=root(X);
         else
             if (root(X)==root(Y))
                 g<<"DA";
             else
                 g<<"NU";}
    f.close();
    g.close();             
    return 0;
}