#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
const int N=1e5+1;
int n,m,t[N],nr[N];

int radacina(int x){
    if(t[x]==0)
        return x;
    t[x]=radacina(t[x]);
    return t[x];
}

void reuniune(int x, int y){
    int rx=radacina(x);
    int ry=radacina(y);
    if(nr[rx]>nr[ry]){
        t[rx]=ry;
        nr[rx]+=nr[ry];
    }
    else{
        t[ry]=rx;
        nr[ry]+=nr[rx];
    }
}

inline bool verif(int x, int y){
    return radacina(x)==radacina(y);
}

int main()
{
    f>>n>>m;
    for(int i=1; i<=n; i++)
        nr[i]=1;
    while(m--){
        int c,x,y;
        f>>c>>x>>y;
        if(c==1)
            reuniune(x,y);
        else
            if(verif(x,y))
                g<<"DA\n";
        else
                g<<"NU\n";
    }
    return 0;
}