#include <fstream>

using namespace std;

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

int n,m;
int T[100003];

int rad(int x)
{
    int r,y;
    r=x;
    while(T[r]!=0)
        r=T[r];
    while(T[x]!=0)
    {
        y=T[x];
        T[x]=r;
        x=y;
    }
    return r;
}

void reuneste(int x, int y)
{
    T[y]=x;
}

int main()
{
    f>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int op,x,y;
        f>>op;
        f>>x>>y;
        if(op==2)
        {
            if(rad(x)==rad(y))
                g<<"DA\n";
            else
                g<<"NU\n";
        }
        else
            reuneste(rad(x),rad(y));
    }
    f.close();
    g.close();
    return 0;
}