#include<iostream>
#include<fstream>
#include<vector>

using namespace std;

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

vector<int> tata(100001);

int n,m, cod, x, y,i;


int findfather(int nod)
{
    if (tata[nod] != nod)
        return findfather(tata[nod]);
    return nod;
}

int main()
{
    f >> n >> m;

    for (i = 0; i < n; i++)
        tata[i] = i;

    for (i = 0; i < m; i++)
    {
        f>>cod>>x>>y;

        if(cod==1)
            tata[findfather(y)]=findfather(x);
        else
            if(findfather(x)==findfather(y))
                g<<"DA \n";
            else g<<"NU \n";
    }

    f.close();
    g.close();
    return 0;
}