#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int x,y,z,t[200100],i,n,m,cod;
int re(int x)
{
    if (x==t[x]) return x;
    t[x]=re(t[x]);
    return t[x];
}
void une(int x,int y)
{
    x=re(x);
    y=re(y);
    if (x==y) return;
    t[x]=re(y);
}

int main()
{
    in>>n>>m;
    for (i=1;i<=n;++i) t[i]=i;
    for (i=1;i<=m;++i)
    {
        in>>cod>>x>>y;
        if (cod==1)
        {
            une(x,y);
        }
        else {if (re(x)==re(y)) out<<"DA"; else out<<"NU"; out<<'\n';}
    }
    return 0;
}