#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;

ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int n, m, nr, x, y;

int sef[100001];

int sef_suprem(int nod)
{
    if(sef[nod]==nod)
        return nod;
    return sef[nod]=sef_suprem(sef[nod]);
}
void unire(int x, int y)
{
    int sefx=sef_suprem(x);
    int sefy=sef_suprem(y);
    sef[sefx]=sefy;
}
int main()
{   cin>>n>>m;
    for(int i=1; i<=n;i++)
        sef[i]=i;
    for(int j=1; j<=m; j++)
    {
        cin>>nr>>x>>y;
    if(nr==1)
    {
        unire(x,y);
    }
    if(nr==2)
    {
        if(sef_suprem(y)==sef_suprem(x))
            cout<<"DA"<<endl;
        else cout<<"NU"<<endl;
    } }
    return 0;
}