#include <iostream>
#include<fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int M, N;
int cc[100001];

int Find(int i)
{
    if(cc[i] == i)
        return i;
    cc[i] = Find(cc[i]);
    return cc[i];
}

int main()
{
    int cod, x, y,cx,cy;

    f >> N >> M;
    for(int i = 1; i <= N; i++)
        cc[i] = i;
    for(int i = 1; i <= M; i++)
    {
        f >> cod >> x >> y;
         cx = Find(x);
         cy = Find(y);
        if(cod == 1 && cx != cy)
            cc[cx] = cy;
        if(cod == 2)
            if(cc[x] == cc[y])
                g << "DA" << '\n';
            else
                g << "NU" << '\n';
    }
    return 0;
}