#include <fstream>
using namespace std;
ifstream f ("disjoint.in");
ofstream g ("disjoint.out");
int n,m,t[100001];
int root(int n)
{
    while(t[n]) n=t[n];
    return n;
}
main()
{
    int o,a,b;
    f>>n>>m;
    while(m--)
    {
        f>>o>>a>>b;
        if(o==1) t[root(b)]=root(a);
        else if(root(a)==root(b)) g<<"DA\n";
        else g<<"NU\n";
    }
    return 0;
}