#include <iostream>
#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
const int Nmax=1e5;
int T[Nmax+3],n,m;
void leaga(int a,int b)
{
    T[a]=T[b];
}
int main()
{
    f >> n >> m;
    for(int i=1; i<=n; i++)
        T[i]=i;
    for(int i=1; i<=m; i++)
    {
        int op,a,b;
        f >> op >> a >> b;
        if(op==1)
            leaga(a,b);
        else {
            T[a]==T[b] ? g << "DA\n" : g << "NU\n";
        }
    }
    return 0;
}