#include <iostream>
#include <fstream>

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

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

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

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

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