#include <fstream>
using namespace std;
ifstream f ("disjoint.in");
ofstream g ("disjoint.out");
const int nmax=1e5+3;
int v[nmax],n,m,tip,a,b;
inline int gr(int nod)
{
    if(v[nod]==nod) return nod;
    v[nod]=gr(v[nod]);
    return v[nod];
}
int main()
{
    f>>n>>m;
    for(int i=1;i<=n;++i) v[i]=i;
    while(m--)
    {
        f>>tip>>a>>b;
        if(tip==1) v[gr(a)]=gr(b);
        else
        {
            if(gr(a)==gr(b)) g<<"DA\n";
            else g<<"NU\n";
        }
    }
    return 0;
}