#include <cstdio>
#define NMAX 100005

using namespace std;

int t[NMAX] , h[NMAX];

inline int findSupremeLeader(int x)
{
    while(x != t[x])
        x = t[x];
    return x;
}

inline void uniteTheClans(int x,int y)
{
    if(h[x] == h[y])
    {
        h[x]++;
        t[y] = x;
    }
    else if(h[x] > h[y])
        t[y] = x;
    else
        t[x] = y;
}

int main()
{
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    int op , n , x , y , m;
    scanf("%d%d",&n,&m);
    for(int i = 1 ; i <= n ; i++)
    {
        t[i] = i;
        h[i] = 1;
    }
    for(int i = 1 ; i <= m ; i++)
    {
        scanf("%d%d%d",&op,&x,&y);
        x = findSupremeLeader(x);
        y = findSupremeLeader(y);
        if(op == 1)/// Unire
            uniteTheClans(x,y);
        else
        {
            if(x == y)
                printf("DA\n");
            else
                printf("NU\n");
        }
    }
    return 0;
}