#include <bits/stdc++.h>

using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
const int N=100010;
int n,m,c,x,y,rx,ry,T[N],root(int);
int main()
{
    f>>n>>m;
    for(int i=1; i<=n ; i++)
        T[i]=i;
    for(;m;m--)
    {
        f>>c>>x>>y;
        rx=root(x);
        ry=root(y);
        if(c==1)
            T[rx]=ry;
        else
            rx==ry?g<<"DA\n":g<<"NU\n";
    }
    return 0;
}
int root(int nod)
{
    if(T[nod]==nod)
        return nod;
    T[nod]=root(T[nod]);
    return T[nod];
}