#include <fstream>
using namespace std;

const int N=100003;
const char s[][10]={"NU\n","DA\n"};
int T[N],size[N],n;

ifstream in("disjoint.in");
ofstream out("disjoint.out");

void reuneste(int x,int y)
{
    if (size[x]>size[y])
    {
        T[y]=x;
        size[x]+=size[y];
    }
    else
    {
        T[x]=y;
        size[y]+=size[x];
    }
}

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

int main()
{
    int m,a,x,y,i;
    in>>n>>m;
    for (i=1;i<=n;i++)
    {
        T[i]=i;
        size[i]=1;
    }
    while (m--)
    {
        in>>a>>x>>y;
        x=radacina(x);
        y=radacina(y);
        if (a==1)
            reuneste(x,y);
        else
            out<<s[x==y];
    }
    return 0;
}