#include <fstream>

using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int n, m;
int rad[100002], card[100002];
int Find(int x)
{
    if(rad[x]==x)
        return x;
    rad[x]=Find(rad[x]);
    return rad[x];
}
void Union(int a, int b)
{
    if(card[a]<card[b])
        swap(a, b);
    rad[b]=a;
    card[a]+=card[b];
}
int main()
{
    in>>n>>m;
    for(int i=1; i<=n; i++)
    {
        rad[i]=i;
        card[i]=1;
    }
    for(int i=1; i<=m; i++)
    {
        int cod, x, y;
        in>>cod>>x>>y;
        if(cod==1)
        {
            if(Find(x)!=Find(y))
            {
                Union(Find(x), Find(y));
            }
        }
        else
        {
            if(Find(x)==Find(y))
                out<<"DA"<<'\n';
            else
                out<<"NU"<<'\n';
        }
    }
}