#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n, m, cod, x, y, minim, maxim, C[100010];

inline int Contr(int i)
{
    if (C[i] == i) return i;
    C[i] = Contr(C[i]);
    return C[i];
}

int main()
{
    fin >> n >> m;
    for (int i=1; i<=n; i++) C[i] = i;
    for (int i=1; i<=m; i++)
    {
        fin >> cod >> x >> y;
        if (cod == 1)
        {
            C[Contr(x)] = Contr(y);
        }
        else
        {
            if (Contr(x) == Contr(y)) fout << "DA\n";
            else fout << "NU\n";
        }
    }

    fout.close();
    return 0;
}