#include <fstream>
#include <vector>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int t[100002];
int find(int x)
{
    int y,rad;
    rad=x;
    while(t[rad])
        rad=t[rad];
    while(t[x])
    {
        y=t[x];
        t[x]=rad;
        x=y;
    }
    return rad;
}
void un(int x,int y)
{
    t[x]=y;
}
void solve()
{
    int n,m,tip,x,y;
    in>>n>>m;
    for(int i=1;i<=m;i++)
    {
        in>>tip>>x>>y;
        x=find(x);
        y=find(y);
        if(tip==1)
        {
            un(x,y);
        }
        else
        {
            if(x==y)
                out<<"DA\n";
            else
                out<<"NU\n";
        }
    }
}
int main()
{
    solve();
    return 0;
}