#include <iostream>
#include <fstream>
#define nmax 100000+5
using namespace std;

int n, m, cod;
int tata[nmax], h[nmax];

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

int fnd(int x)
{
    int r=x;
    while(tata[r]) r=tata[r];
    int y=x, aux;
    while(y!=r)
    {
        aux=tata[y]; tata[y]=r; y=aux;
    }
    return r;
}

void uni(int x, int y)
{
    if(h[x] > h[y])
        tata[y] = x;
    else
    {
        tata[x] = y;
        if(h[x] == h[y])
            h[y]++;
    }
}

int main()
{
    f >> n >> m;
    for(int i=0, x, y; i<m; ++i)
    {
        f >> cod >> x >> y;
        if(cod == 1)
            uni(x ,y);
        else
        {
            if(fnd(x) == fnd(y))
                g << "DA" << '\n';
            else
                g << "NU" << '\n';
        }
    }
    f.close();
    g.close();
    return 0;
}