#include <fstream>
using namespace std;
int n,m,tata[100001];

ifstream f("disjoint.in");
ofstream g("disjoint.out");
int root(int a)
{
    while(tata[a])
        a=tata[a];
    return a;
}
int main()
{
    int tip,x,y;
    f>>n>>m;
    while(m--)
    {
        f>>tip>>x>>y;
        if(tip==1)
            tata[root(y)]=root(x);
        else if(root(x)==root(y))
            g<<"DA"<<'\n';
        else
            g<<"NU"<<'\n';
    }
    return 0;
}