#include <fstream>
#define NMAX 100020
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int TT[NMAX], RG[NMAX];
int N, M;

int find(int x)
{
    int R, y;
    for (R = x; TT[R] != R; R = TT[R]);
    for (; TT[x] != x;)
    {
        y = TT[x];
        TT[x] = R;
        x = y;
    }
    return R;
}
int main()
{
    fin>>N>>M;
    int i, x, y, cd;
    //initial fiecare nod pointeaza catre el insusi iar rangul fiecarui arbore este 1
    for (i = 1; i <= N; i++)
        TT[i] = i;
    for (i = 1; i <= M; i++)
    {
        fin>>cd>>x>>y;

        if (cd == 2){
            //verific daca radacina arborilor in care se afla x respectiv y este egala
            if (find(x) == find(y)) fout<<"DA\n";
                else
                    fout<<"NU\n";
        }
            else //unesc radacinile arborilor corespunzatori multimilor nodurilor x respectiv y
                TT[y] = x;

    }

    return 0;
}