#include <iostream>
#include <fstream>
using namespace std;

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

int n,m,p[100001];
int parinte(int nod)
{
    if(p[nod]==nod)
        return nod;
    return p[nod]=parinte(p[nod]);
}
void unite(int x,int y)
{
    p[parinte(x)]=parinte(y);
}
int main()
{

    int cod,x,y;
    in>>n>>m;
    for(int i=1;i<=n;i++)
        p[i]=i;
    for(int i=1;i<=m;i++)
    {
        in>>cod>>x>>y;
        if(cod==1)
            unite(x,y);
        else
            if(p[parinte(x)]==p[parinte(y)])
                out<<"DA"<<endl;
            else
                out<<"NU"<<endl;
    }
    in.close();
    out.close();
    return 0;
}