#include <bits/stdc++.h>
#define NMAX 100005

using namespace std;
ifstream fin("disjoint.in") ;
ofstream fout("disjoint.out") ;

int n, m, v[NMAX], c, x, y, X, Y ;

int FindRoute(int x)
{
    while(v[x] != 0)
        x = v[x] ;
    return x ;
}

int main()
{
    fin >> n >> m ;
    for(int i=1; i<=m; i++)
    {
        fin >> c >> x >> y ;
        X = FindRoute(x) ;
        Y = FindRoute(y) ;
        if(c == 1)
            v[X] = Y ;
        else
        {
            if(X == Y)
                fout << "DA" << "\n" ;
            else
                fout << "NU" << "\n" ;
        }
    }

    return 0;
}