#include <bits/stdc++.h>
#define ff first
#define ss second
#define NMAX 100020
#define pb push_back
using namespace std;
const string file = "disjoint";

ifstream fin (file+".in");
ofstream fout (file+".out");
typedef long long ll;
typedef long double ld;

const ll INF = 9223372036854775807ll;
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, inf = 2147483647;

int gr[NMAX], len[NMAX]; // din ce grupa e fiec nod, inaltimea arborelui
void reunion(int x, int y) ;
int findit(int x);
int N,M,t;
int main()
{
    int x,y;
    fin >> N >> M;
    for(int i=1;i<=N;++i) gr[i]=i, len[i]=1;
    for(int i=1;i<=M;++i)
    {
        fin >> t >> x >> y;
        if (t==2){
			//verific daca radacina arborilor in care se afla x respectiv y este egala
			if (findit(x) == findit(y)) fout<<"DA\n";
				else fout<<"NU\n";
		}
			else //unesc radacinile arborilor corespunzatori multimilor nodurilor x respectiv y
				{
					//if (findit(x) == findit(y))	 {fprintf(stderr,"%d ", i);return 0;}
					reunion(findit(x), findit(y));
				}
    }
    return 0;
}
void reunion(int x, int y)
{
    if(len[x] > len[y])
        gr[y]=gr[x];
    else gr[x]=gr[y];
    if(len[x]==len[y]) len[y]++;
}
int findit(int x)
{
    int R,y;
    R=x;
    while(R!=gr[R])
        R=gr[R];
    y=x;
    while(y!=R)
    {
        int aux=gr[y];
        gr[y]=R;
        y=aux;
    }
    return R;
}