#include <iostream>
using namespace std;
int tt[100005];
int rang[100005];
int search_tt(int nod)
{
    while (tt[nod]) {
        nod=tt[nod];
    }
    return nod;
}
int main()
{
    freopen("disjoint.in", "r", stdin);
    freopen("disjoint.out", "w", stdout);
    int n, m, c, x, y;
    cin>>n>>m;
    for (int i=1; i<=m; i++) {
        cin>>c>>x>>y;
        int rad1=search_tt(x);
        int rad2=search_tt(y);
        if (c==1) {
            if (rang[rad1]==0) rang[rad1]++;
            if (rang[rad2]==0) rang[rad2]++;

            if (rang[rad1]>=rang[rad2]) {
                rang[rad1]+=rang[rad2];
                tt[rad2]=rad1;
            }
            else {
                rang[rad2]+=rang[rad1];
                tt[rad1]=rad2;
            }
        }
        if (c==2) {
            if (rad1==rad2) {
                cout<<"DA\n";
            }
            else cout<<"NU\n";
        }
    }
    return 0;
}