#include <fstream>
using namespace std;

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

const int N=1e5;
int daddy[N+1], nr[N+1], h;
bool ans[N+1];

/// returneaza radacina arborelui din care face parte x
int radacina(int x)
{
    if (daddy[x] == x)
        return x;
    return daddy[x] = radacina(daddy[x]);
}

/// returneaza daca x si y se afla in aceeasi multime
bool query(int x, int y)
{
    return radacina(x)==radacina(y);
}


/// uneste pe x si y
void unite(int x, int y)
{
    int rx = radacina(x);
    int ry = radacina(y);

    /// Uniune dupa rang
    if (nr[rx] > nr[ry])
    {
        daddy[ry] = rx;
        nr[rx] += nr[ry];
        nr[ry] = nr[rx];
    }
    else
    {
        daddy[rx] = ry;
        nr[ry] += nr[rx];
        nr[rx] = nr[ry];
    }
}


int main()
{
    int n, q;
    cin >> n >> q;
    for (int i = 1; i <= n; i++)
    {
        daddy[i] = i;
        nr[i] = 1;
    }

    for(int i=1; i<=q; i++)
    {
        int t, x, y;
        cin >> t >> x >> y;
        if (t == 1)
        {
            unite(x, y);
        }
        else if(t == 2)
        {
            if(query(x, y) == 1)
                {
                    ans[h]=1;
                    h++;
                }
            else
            {
                ans[h]=0;
                h++;
            }
        }
    }

    for(int i=0; i<h; i++)
    {
        if(ans[i]==1)
            cout << "DA" << '\n';
        else cout << "NU" << '\n';
    }
    return 0;
}