#include <bits/stdc++.h>

using namespace std;

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

int n,m,x,y,tip;
int card[100005],parent[100005];

void findparent(int pos)
{
    if(parent[pos]!=pos)
    {
        parent[pos]=findparent(parent[pos]);
        return parent[pos];
    }
    return pos;

}

void reuniune(int x,int y)
{
    x=findparent(x);
    y=findparent(y);
    if(card[x]<card[y])
        swap(x,y);
    parent[y]=parent[x];
    card[x]+=card[y];

}

int main()
{
    cin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        parent[i]=i;
        card[i]=1;
    }

    for(int i=1;i<=m;i++)
    {
        cin>>tip>>x>>y;
        if(tip==1)
        {
            reuniune(x,y);
        }
        else
        {
            if(findparent(x)==findparent(y))
                cout<<"DA"<<endl;
            else
                cout<<"NU"<<endl;
        }
    }
    return 0;
}