using namespace std;
#include <cstdio>

#define NMAX 100020

int TT[NMAX];
int N, M;

int find(int x)
{
   int R;

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

    return R;
}

void unite(int x, int y)
{

    TT[y] = x;

}

int main()
{
    freopen("disjoint.in", "r", stdin);
    freopen("disjoint.out", "w", stdout);

    scanf("%d %d ", &N, &M);

    int i, x, y, cd;

    for (i = 1; i <= N; i++)
    {
    TT[i] = i;
    }

    for (i = 1; i <= M; i++)
    {
        scanf("%d %d %d", &cd, &x, &y);

        if (cd == 2){

            if (find(x) == find(y))
                printf("DA\n");
            else
                printf("NU\n");
        }
        else
        {
        unite(x, find(y));
        }
    }
    return 0;
}