#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>

#define MMAX 100005
#define NMAX 100005
using namespace std;

ifstream fin ("disjoint.in");
ofstream fout ("disjoint.out");

int n, m, t[NMAX], op, x, y;

int find_tata(int nod)
{
    int cnod=nod;
    while(t[nod]!=nod)
        nod=t[nod];
    t[cnod]=nod;
    return nod;
}

void reuniune (int x, int y)
{
    int tx=find_tata(x), ty=find_tata(y);
    if(tx!=ty)
        t[tx]=ty;
}

void query (int x, int y)
{
    int tx=find_tata(x), ty=find_tata(y);
    if(tx==ty)
        fout<<"DA\n";
    else
        fout<<"NU\n";
}

int main()
{
    fin>>n>>m;
    for(int i=1; i<=n; i++)
        t[i]=i;
    for(int i=1; i<=m; i++)
    {
        fin>>op>>x>>y;
        if(op==1)
            reuniune(x, y);
        else
            query(x, y);
    }
    return 0;
}