#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)
{
    if(parinti[x] != parinti[y])
        parinti[parinti[x]] = parinti[parinti[y]];
//    for(int i = 1; i <= nrVertices; i++)
//        cout << parinti[i] << ' ';
//    cout << '\n';
}

int root(int x)
{
    int i = x;
    while (parinti[i] != i) {
        i = parinti[i];
    }
    return i;
}

void resolve()
{
    int queryType, x, y;
    for(int i = 1; i <= nrQueries; i++)
    {
        fin >> queryType >> x >> y;
        x = root(x);
        y = root(y);
        if(queryType == 1)
        {
            if(x != y)
            {
                parinti[x] = y;
            }
        }
        else
        {
            if(x == y)
                fout << "DA\n";
            else
                fout << "NU\n";
        }
    }
}



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