/*#include <stdio.h>
#define NMAX 100020
int TT[NMAX], RG[NMAX];
int N, M;
int find(int x)
{
	int R, y;
	//merg in sus pe arbore pana gasesc un nod care pointeaza catre el insusi
	for (R = x; TT[R] != R; R = TT[R]);

	for (; TT[x] != x;)
	{
		y = TT[x];
		TT[x] = R;
		x = y;
	}
	return R;
}

void unite(int x, int y)
{
	//unesc multimea cu rang mai mic de cea cu rang mai mare
	if (RG[x] > RG[y])
		TT[y] = x;
			else TT[x] = y;

	//in caz ca rangurile erau egale atunci cresc rangul noii multimi cu 1
	if (RG[x] == RG[y]) RG[y]++;
}

int main()
{
	freopen("disjoint.in", "r", stdin);
	freopen("disjoint.out", "w", stdout);

	scanf("%d %d ", &N, &M);

	int i, x, y, cd;

	//initial fiecare nod pointeaza catre el insusi iar rangul fiecarui arbore este 1
	for (i = 1; i <= N; i++)
	{
		TT[i] = i;
		RG[i] = 1;
	}

	for (i = 1; i <= M; i++)
	{
		scanf("%d %d %d", &cd, &x, &y);

		if (cd == 2){
			//verific daca radacina arborilor in care se afla x respectiv y este egala
			if (find(x) == find(y)) printf("DA\n");
				else printf("NU\n");
		}
			else //unesc radacinile arborilor corespunzatori multimilor nodurilor x respectiv y
				{
					if (find(x) == find(y))	 {fprintf(stderr,"%d ", i);return 0;}
					unite(find(x), find(y));
				}
	}

	return 0;
}
*/
#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int TT[100020],RG[100020],N,M,x,y,i,cd;

int radacina(int x)
{
    int r,y;
    r=x;
    while(TT[r]!=r)
        r=TT[r];
    while(TT[x]!=x)
    {
        y = TT[x];
		TT[x] = r;
		x = y;
    }
    return r;
}
void unite(int x, int y)
{
    if(RG[x]>RG[y])
        TT[y] = x;
        else TT[x] = y;
    if(RG[x] == RG[y]) RG[y]++;
}
int main()
{
    f>>N>>M;
    for(i=1;i<=N;i++)
    {
        TT[i]=i;
        RG[i]=1;
    }
    for(i=1;i<=M;i++)
    {
      f>>cd>>x>>y;
      if(cd==2)
      {
          if(radacina(x)==radacina(y)) g<<"DA"<<'\n';
          else g<<"NU"<<'\n';
      }
      else
        {
        unite(radacina(x),radacina(y));
      }
    }
    return 0;
}