#include <algorithm>
using namespace std;

#define DIM 100001

int n, m, rang[ DIM ], tata[ DIM ];

void unite( int x, int y ) {

    if( rang[ x ] < rang[ y ] )
        tata[ x ] = y;
    else
        tata[ y ] = x;
    if( rang[ x ] == rang[ y ] )
        ++ rang[ x ];
}

int find( int x ) {

    if( x != tata[ x ] )
        tata[ x ] = find( tata[ x ] );

    return tata[ x ];
}

void init() {

    int i;

    for( i = 1; i <= n; ++ i ) {

        rang[ i ] = 1;
        tata[ i ] = i;
    }
}

void read() {

    int i, x, y, tip;

    scanf( "%d%d", &n, &m );
    init();
    for( i = 0; i < m; ++ i ) {

        scanf( "%d%d%d", &tip, &x, &y );
        if( tip == 1 )
            unite( x, y );
        else if( tip == 2 ) {

            if( find( x ) == find( y ) )
                printf( "DA\n" );
            else
                printf( "NU\n" );

        }
    }
}

int main() {

    freopen( "disjoint.in", "r", stdin );
    freopen( "disjoint.out", "w", stdout );

    read();

    return 0;
}