#include <bits/stdc++.h>

using namespace std;

const int mxn = 100 * 1000 + 10;

int n, m;
int p[ mxn ];

int daddy(int nod){
    if(nod == p[nod])
        return nod;
    return p[nod] = daddy(p[nod]);
}

int main()
{
    ios_base::sync_with_stdio( false );
    cin.tie( 0 );
    ifstream cin("disjoint.in");
    ofstream cout("disjoint.out");
    cin>> n >> m;
    for(int i = 1; i <= n; i++)
        p[ i ] = i;
    for(int i = 0, cer, x, y; i < m; i++){
        cin>> cer >> x >> y;
        if(cer == 1)
            p[ daddy( x ) ] = p[ daddy( y ) ];
        else{
            if(daddy( x ) == daddy( y ))
                cout<<"DA\n";
            else
                cout<<"NU\n";
        }
    }
    return 0;
}