#include <cstdio>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <algorithm>
#include <utility>
#include <string>
#include <functional>
#include <sstream>
#include <fstream>
#include <iostream>
using namespace std;
#define FOR(i,a,b) for (i=a;i<=b;i++)
#define fori(it,v) for (it=(v).begin();it!=(v).end();it++)
#define pb push_back
#define mp make_pair
#define fs first
#define ss second
#define all(c) c.begin(),c.end()
#define pf push_front
#define popb pop_back
#define popf pop_front
FILE *in,*out;
int a[100005];
int rep(int x)
{
	if (a[x]==x)
		return x;
	return a[x]=rep(a[x]);
}
void uneste(int x,int y)
{
	int r1=rep(x),r2=rep(y);
	if (r1==r2)
		return ;
	a[r1]=r2;
}
int main()
{
	int i,n,m,z,x,y;
	in=fopen("disjoint.in","r");
	out=fopen("disjoint.out","w");
	fscanf(in,"%d%d",&n,&m);
	FOR(i,1,n)
		a[i]=i;
	FOR(i,1,m)
	{
		fscanf(in,"%d%d%d",&z,&x,&y);
		if (z==1)
		{
			uneste(x,y);
			continue ;
		}
		fprintf(out,rep(x)==rep(y)?"DA\n":"NU\n");
	}
	fclose(in);
	fclose(out);
	return 0;
}