#include <bits/stdc++.h>

using namespace std;

ifstream in("disjoint.in");
ofstream out("disjoint.out");

int p[100001];
int n,m;

int parents(int n)
{
    while(p[n])
		n=p[n];
	return n;
}
int main()
{
    in>>n>>m;
    for(int i=1; i<=m; i++)
    {
        int o,x,y;
        in>>o>>x>>y;
        if(o==1)
			p[parents(x)]=parents(y);
		else if(parents(x)==parents(y))out<<"DA"<<'\n';
		else out<<"NU"<<'\n';
    }
    return 0;
}