#include<bits/stdc++.h>

using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int t[100002];
void Union(int x, int y)
{
    t[y]=x;
}
int Find(int x)
{
    int rad,y;
	rad = x;
	while (t[rad] != 0)
		rad = t[rad];
	while (x != rad)
	{
		y = t[x];
		t[x] = rad;
		x = y;
}
	return rad;

}
int main()
{
    int n,m,op,x,y,i;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>op>>x>>y;
        x=Find(x);
        y=Find(y);
        if(op==1)
         {
            if(x!=y) Union(x,y);}
        else
            if(x==y) fout<<"DA"<<"\n";
            else
                fout<<"NU"<<"\n";
    }
        return 0;

}