#include <fstream>

using namespace std;

int dsu[100005], tata = 0, lung;
int lg[100005];

void find_tata(int nod)
{
    if(nod != dsu[nod])
    {
        lung++;
        find_tata(dsu[nod]);
        dsu[nod] = tata;
        lg[nod] = lung;
    }
    else
    {
        tata = nod;
    }
}

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

    int n, m;
    cin>>n>>m;
    for(int i = 1; i <= n; i++)
        dsu[i] = i;
    for(int i = 1; i <= m; i++)
    {
        int op, a, b;
        cin>>op>>a>>b;

        if(op == 1)
        {
            int lung1, lung2, tata1, tata2;

            lung = lg[a];
            find_tata(a);
            lung1 = lung;
            tata1 = tata;

            lung = lg[b];
            find_tata(b);
            lung2 = lung;
            tata2 = tata;

            if(lung1 < lung2)
                dsu[tata1] = tata2;
            else
                dsu[tata2] = tata1;
        }
        else
        {
            int tata1, tata2;

            find_tata(a);
            tata1 = tata;

            find_tata(b);
            tata2 = tata;

            if(tata1 == tata2)
                cout<<"DA"<<'\n';
            else
                cout<<"NU"<<'\n';
        }

    }
    return 0;
}