#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m,t[100001],l[100001];
int fnd(int x)
{
	int r,y;
	r=x;
	while(t[r]!=r)
        r=t[r];
    y=x;
    int tata;
	while(y!=r)
	{
		tata=t[y];
		t[y]=r;
		y=tata;
	}
	return r;
}
void unire(int x, int y)
{
	if (l[x]>l[y])
		t[y]=x;
    else
        t[x]=y;
	if (l[x]==l[y])
        l[y]++;
}
int main()
{
    fin>>n>>m;
    int i;
    for(i=1; i<=n; i++)
    {
        t[i]=i;
        l[i]=1;
    }
    for(i=1; i<=m; i++)
    {
        int p,x,y;
        fin>>p>>x>>y;
        if(p==1)
        {
            unire(fnd(x),fnd(y));
        }
        else
        {
            if(fnd(x)==fnd(y))
                fout<<"DA";
            else
                fout<<"NU";
            fout<<'\n';
        }
    }
    return 0;
}