#include <iostream>
#include <fstream>
using namespace std;

int tata[100001], rang[100001], i, n, m, t;
int find(int nod)
{
    if(tata[nod] != nod)
        tata[nod] = find(tata[nod]);
    return tata[nod];
}

void Union(int x, int y)
{
    x = find(x);
    y = find(y);
    if(x != y)
    {
        if(rang[x] > rang[y])
        {
            rang[x] = rang[x] + rang[y];
            tata[y] = x;
        }
        else
        {
            rang[y] = rang[y] + rang[x];
            tata[x] = y;
        }
    }

}
int main()
{
    ifstream f("disjoint.in");
    ofstream g("disjoint.out");

    int x,y;
    f >> n >> m;

    for(i = 1; i <= n; ++ i)
    {
        tata[i] = i;
        rang[i] = 1;
    }

    for(i = 1; i <= m; ++ i)
    {
        f >> t >> x >> y;
        if(t == 1)
        {
            rang[max(tata[tata[x]], tata[tata[y]])] += rang[min(tata[x], tata[y])];//v[v[max(v[x].sef, v[y].sef)].sef].ct += v[min(v[x].sef, v[y].sef)].ct;
            tata[min(tata[x], tata[y])] = tata[max(tata[tata[x]], tata[tata[y]])];//v[min(v[x].sef, v[y].sef)].sef = v[v[max(v[x].sef, v[y].sef)].sef].sef;
        }
        else if(tata[tata[x]] == tata[tata[y]]) g << "DA" << '\n';
        else g << "NU" << "\n";
    }
    return 0;
}