#include <fstream>
#define N 100000

using namespace std;

int n,m,T[N+5];
int rad(int x)
{
    int r,y;
    r=x;
    while(T[r]) r=T[r];
    while(T[x])
    {
        y=T[x];
        T[x]=r;
        x=y;
    }
    return r;
}
void reuneste(int x,int y)
{
    T[x]=y;
}
int main()
{
    ifstream f("disjoint.in");
    ofstream g("disjoint.out");
    f>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int op,x,y;
        f>>op>>x>>y;
        if(op==2)
        {
            if(rad(x)==rad(y))
                g<<"DA\n";
            else
                g<<"NU\n";
        }
        else
            reuneste(rad(x),rad(y));
    }
    return 0;
}