#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int t[100001],n,m;
int Find(int x)
{
    while(t[x])
        x=t[x];
    return x;
}
void Union(int x,int y)
{
    t[Find(x)]=Find(y);
}
int main()
{
    int i,c,x,y;
fin>>n>>m;
for(i=1;i<=m;i++)
{
    fin>>c>>x>>y;
    if(c==1)
    Union(x,y);
    else
    {
        if(Find(x)==Find(y))
            fout<<"DA"<<"\n";
        else
            fout<<"NU"<<"\n";
    }
}
    return 0;
}