#include <iostream>
#include <fstream>
#include <vector>
using namespace std;


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

vector<int> parinti;
int nrVertices, nrQueries;

void init()
{
    fin >> nrVertices >> nrQueries;
    parinti = vector<int>(nrVertices+1);
    for(int i = 1; i <= nrVertices; i++)
        parinti[i] = i;
}

void unify(int x, int y)
{
    parinti[parinti[y]] = parinti[x];
//    for(int i = 1; i <= nrVertices; i++)
//        cout << parinti[i] << ' ';
//    cout << '\n';
}

void isConnected(int x, int y)
{
    int i = y, j = x;
    while (parinti[i] != i) {
        i = parinti[i];
    }
    while (parinti[j] != j) {
        j = parinti[j];
    }
    if(i == j)
        fout << "DA\n";
    else
        fout << "NU\n";
}

void resolve()
{
    int queryType, x, y;
    for(int i = 1; i <= nrQueries; i++)
    {
        fin >> queryType >> x >> y;
        if(queryType == 1)
        {
            if(x>y)
                swap(x,y);
            unify(x, y);
        }
        else
        {
            isConnected(x, y);
        }
    }
}



int main()
{
    init();
    resolve();
    
    
    return 0;
}