#include <iostream>
#include <fstream>

using namespace std;

const int NMAX = 1000001;

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

int N, M, T[NMAX], H[NMAX];

int Find(int x)
{
    int y, z;
    for(y = T[x]; y != T[y]; y = T[y]);
    while(x != T[x])
    {
        z = T[x];
        T[x] = y;
        x = z;
    }
    return y;
}

void Union(int x, int y)
{
    if(H[x] < H[y])
        T[x] = y;
    else
    {
        T[y] = x;
        if(H[x] == H[y])
            H[y]++;
    }
}

int main()
{
    f >> N >> M;
    for(int i = 1; i <= N; i++)
    {
        T[i] = i;
        H[i] = 1;
    }
    while(M--)
    {
        int cod, x, y;
        f >> cod >> x >> y;
        x = Find(x);
        y = Find(y);
        if(cod == 1)
            ///if(x!=y)
            Union(x, y);
        else
            if(x == y)
                g << "DA\n";
            else
                g << "NU\n";
    }
    return 0;
}