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

using namespace std;

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

const int MAX = 100005;


int T[MAX];
int C[MAX];

int N ,M ,tip, x, y;

void Unifica(int i ,int j)
{
    if(C[i] >= C[j])
    {
        C[i] += C[j];
        T[j] = i;
    }

    else
    {
        C[j] += C[i];
        T[i] = j;
    }
}

int Radacina(int i)
{
    int k;
     k = i;

     while ( T[k] > 0)
        k = T[k];

     while( T[i] > 0)
     {
         T[i] = k;
         i = T[i];
     }

     return i;
}

int main()
{
    in >> N >> M;

    for ( int i = 1; i <= N ; ++i)
    {
        T[i] = 0;
        C[i] = 1;
    }

    for ( int i = 1; i <= M ;++i)
    {
        in >> tip >> x >> y;

        if ( tip == 1)
            if ( Radacina(x) != Radacina(y) )Unifica(x,y);

        if ( tip == 2)
            if ( Radacina(x) != Radacina(y) ) out << "NU" <<"\n";
        else out << "DA" <<"\n";
    }


    return 0;
}