#include <bits/stdc++.h>

using namespace std;

int tata[100005];

int findd(int u)
{
    if(tata[u] == u) return u;
    return tata[u] = findd(tata[u]);
}

void unite(int u, int v)
{
    u = findd(u);
    v = findd(v);

    if(u != v)
    {
        if(tata[u] >= tata[v])
            tata[u] = v;
        else
            tata[v] = u;
    }

    return;
}

int main()
{
    ifstream cin("disjoint.in");
    ofstream cout("disjoint.out");
    int n, k, cer, x, y;
    cin>>n>>k;

    for(int i=1; i<=n; i++)
        tata[i] = i;

    for(int i=0;i<k;i++)
    {
        cin>>cer>>x>>y;
        if(cer == 1)
            unite(x, y);
        else if(cer == 2 && findd(x) == findd(y))
            cout<<"DA"<<'\n';
        else
            cout<<"NU"<<'\n';
    }


    return 0;
}