#include <iostream>
#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
const int NMAX = 10e5+1;



int tata[NMAX+1];
int ad[NMAX+1];


void generare(int n)
{
    for(int i=1; i<=n; i++)
    {
        tata[i] = i;
        ad[i] = 1;
    }
}
int caut(int nod)
{
    if (nod == tata[nod])
        return nod;
    return tata[nod] = caut(tata[nod]);
}
void unire(int a, int b)
{
    a = caut(a);
    b = caut(b);
    if (a != b)
    {
        if (ad[a] < ad[b])
            swap(a, b);
        tata[b] = a;
        ad[a] += ad[b];
    }
}


int main()
{
    int n,m,c,a,b;
    f>>n>>m;
    generare(n);
    for(int i=1;i<=m;i++)
    {
        f>>c>>a>>b;
        if(c==1)
        {
            unire(a,b);
        }
        else if(c==2&&caut(a)==caut(b))
                g<<"DA\n";
            else g<<"NU\n";

    }

    return 0;
}