#include <bits/stdc++.h>
using namespace std;

ifstream f("disjoint.in");
ofstream g("disjoint.out");
int n, m;
int TT[100005];
int RG[100005];
int tip, x, y;

int find(int x)
{
    int R, y;

    for(R = x;R != TT[R];R = TT[R]);

    while(x != TT[x])
    {
        y = TT[x];
        TT[x] = R;
        x = y;
    }

    return R;
}

void unite(int x,int y)
{
    if(RG[x] > RG[y])
        {
            TT[y] = x;
            RG[x] += RG[y];
        }
    else
    {
        TT[x] = y;
        RG[y] += RG[x];
    }

}

void Read()
{
    f>>n>>m;
    for(int i = 1;i <= n;++i)
    {
        TT[i] = i;
        RG[i] = 1;
    }
}

void Solve()
{
    for(int i = 1;i <= m;++i)
    {
        f>>tip>>x>>y;
        if(tip == 1)
            {
                if(find(x) != find(y))
                    unite(find(x), find(y));
            }
        else
        {
            if(find(x) == find(y))
                g<<"DA"<<'\n';
            else
                g<<"NU"<<'\n';
        }
    }
}

int main()
{
    Read();
    Solve();
    return 0;
}