#include <iostream>
#include <fstream>

using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");

const int Nmax = 100005;
int n, m, t[Nmax], r[Nmax];

int Tata(int x)
{
    while(t[x] != x) x = t[x];
    return x;
}

void Unite(int x, int y)
{
    if(r[x] == r[y]) t[x] = y, r[x]++;
    else if(r[x] < r[y]) r[x] = y;
        else r[y] = x;
}

int main()
{
    f>>n>>m;
    for(int i = 1; i <= n; i++) t[i] = i;
    while(m--)
    {
        int op, x, y;
        f>>op>>x>>y;
        if(op == 1) Unite(Tata(x), Tata(y));
        else
            if(Tata(x) == Tata(y)) g<<"DA\n";
            else g<<"NU\n";
    }
    return 0;
}