#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("disjoint.in");
ofstream g ("disjoint.out");
int sef[100010];
int sefsuprem(int i)
{
    if (sef[i]==i)
        return i;
    return sef[i]=sefsuprem(sef[i]);
}
void unire(int x,int y)
{
    int sefx,sefy;
    sefx=sefsuprem(x);
    sefy=sefsuprem(y);
    sef[sefx]=sefy;
}
int main()
{
    int n,m,i,tip,x,y;
    f>>n>>m;
    for (i=1; i<=n; i++)
        sef[i]=i;
    for (i=1; i<=m; i++)
    {
        f>>tip>>x>>y;
        if (tip==1)
            unire(x,y);
        else
        {
            if (sefsuprem(x)==sefsuprem(y))
                g<<"DA\n";
            else
                g<<"NU\n";
        }
    }
    return 0;
}