#include <bits/stdc++.h>

using namespace std;

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

int t[100007], n, Q;

int Find(int x)
{
    int y, rad = x;

    while(t[rad])
        rad = t[rad];

    while(x != rad)
    {
        y = t[x];
        t[x] = rad;
        x = y;
    }

    return rad;
}

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

inline void Citire()
{
    int i, cod, x, y;

    fin >> n >> Q;

    for(i = 1; i <= Q; i++)
    {
        fin >> cod >> x >> y;

        x = Find(x);
        y = Find(y);
        if(cod == 1 && x != y)
            Union(x, y);
        else
        {
            if(x == y)
                fout << "DA\n";
            else
                fout << "NU\n";
        }
    }
}
int main()
{
    Citire();
    return 0;
}