#include <iostream>
#include <fstream>

using namespace std;
const int NMAX = 100001;

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

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

int Find(int x)
{
    if(T[x] == 0)
        return x;
    else
        return T[x] = Find(T[x]);
}

inline void Union(int x, int y)
{
    T[x] = y;
}

int main()
{
    in >> N >> M;
    for(int i = 1; i <= M; i++)
    {
        in >> cod;
        int x, y, rx, ry;
        in >> x >> y;
        rx = Find(x);
        ry = Find(y);
        if(cod == 1)
        {
            if(rx != ry)
            Union(rx, ry);
        }
        else
            if(rx == ry)
            out << "DA" << '\n';
        else
            out << "NU" << '\n';
    }
    in.close();
    out.close();
    return 0;
}