#include<fstream>
#define maxn 100001
using namespace std;

ifstream f("disjoint.in");
ofstream g("disjoint.out");
int tata[maxn], n, m, cod, x, y;

int find(int i)
{if(tata[i]!=i)
   tata[i]=find(tata[i]);
return tata[i];
}

int main()
{f>>n>>m;

for(; n; n--)
   tata[n]=n;

for(; m; m--)
   {f>>cod>>x>>y;
    if(cod==1)
      tata[find(x)]=find(y);
	else {if(find(x)==find(y))
			g<<"DA"<<endl;
		  else g<<"NU"<<endl;
		 }
   }

f.close();
g.close();
return 0;   
}