#include<fstream>
#include<iostream>
#include<queue>
using  namespace std;
int n,m;
int ds[100000];
int get(int x)
{
    if( x==ds[x] ) return x;
    else return ds[x] = get(ds[x]);
}
void unionn(int x,int y)
{
    if (rand() %2 == 0)
        ds[get(x)] = get(y);
    else ds[get(y)] = get(x);
}
int main()
{
	freopen("disjoint.in", "r", stdin);
    freopen("disjoint.out", "w", stdout);
	scanf("%d %d",&n,&m);
	for(int i=0; i<n; i++)
        ds[i] = i;
	for(int i=0; i<m; i++)
	{
		int op,x,y;
		scanf("%d %d %d",&op,&x,&y);
		x--;y--;
		if( op==1 ) unionn(x,y);
		else {
                if( get(x) == get(y) ) printf("DA\n");
                else printf("NU\n");
            }
	}
	return 0;
}