#include <fstream>

using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int n,m,t[100005],h[100005];
int fnd(int x)
{
    int r=x;
    while(t[r]) r=t[r];
    int y=x,t1;
    while(y!=r)
    {
        t1=t[y];
        t[y]=r;
        y=t1;
    }
    return r;
}
int uni(int x,int y)
{
    int c;
    x=fnd(x);
    y=fnd(y);
    if(h[x]<h[y])
    {
        t[x]=y;
        c=y;
    }
    else {t[y]=x;c=x;}
    if(h[x]==h[y]) h[c]++;
}
int main()
{
    int op,x,y,i;
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>op>>x>>y;
        if(op==1) uni(x,y);
        else if(fnd(x)==fnd(y)) g<<"DA"<<'\n';
        else g<<"NU"<<'\n';
    }
    return 0;
}