#include <cstdio>
#include <ctime>
#include <cstdlib>
using namespace std;

int n, m, tip, a, b, v[100003];

int findd (int x)
{
    if (x == v[x]){
        return x;
    }
    v[x] = findd(v[x]);
    return v[x];
}

void unionn (int x, int y)
{
    int i, j;
    i = findd (x);
    j = findd (y);
    if (rand()%2){
        v[i] = j;
    }
    else{
        v[j] = i;
    }

}

int main ()
{
    freopen ("disjoint.in", "r", stdin);
    freopen ("disjoint.out", "w", stdout);
    srand (time (0));
    scanf ("%d %d", &n, &m);
    for (int i=1; i<=n; i++){
        v[i] = i;
    }
    for (int i=1; i<=m; i++){
        scanf ("%d %d%d", &tip, &a, &b);
        if (tip == 1){
            unionn (a, b);
        }
        else{
            if (findd (a) == findd (b)){
                printf ("DA\n");
            }
            else{
                printf ("NU\n");
            }
        }
    }
    return 0;
}