#include <fstream>
#define lmax 100005
using namespace std;
int n,m,x,i,p[lmax],cod,y;
int str(int x)
{
    while(x!=p[x])x=p[x];
    return x;
}
int u(int x)
{
    if(x==p[x])return x;
    p[x]=u(p[x]);
    return u(p[x]);
}
int main()
{
    ifstream fin("disjoint.in");
    ofstream fout("disjoint.out");
    fin>>n>>m;
    for(i=1;i<=n;i++)
        p[i]=i;
    for(i=1;i<=m;i++)
    {
        fin>>cod>>x>>y;
        if(cod==1)
          p[str(x)]=str(y),p[str(y)]=str(x);
        else
        {
            if(u(x)==u(y))fout<<"DA\n";
                else fout<<"NU\n";
        }

    }
    return 0;
}
///1->2 , 2->3