#include <fstream>

using namespace std;
#define N 1000005
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int P[N],S[N],n,m;
int Find(int nod)
{
    if(P[nod]==nod)
        return nod;
    else
        Find(P[nod]);
}
int main()
{
    int i,c,x,y,a,b;
    cin>>n>>m;
    for(i=1;i<=n;i++)
        P[i]=i;
    for(i=1; i<=m; i++)
    {
        cin>>c>>x>>y;
        P[x]=Find(x);
        P[y]=Find(y);
        if(c==1)
            P[P[x]]=P[y];
        else
        {
            if(Find(x)==Find(y))
                cout<<"DA";
            else
                cout<<"NU";
            cout<<'\n';
        }
    }
    return 0;
}