#include <cstdio>

#define MAX_N 100005

int T[MAX_N], R[MAX_N];
int N, M;

void unite(int x, int y)
{
    if(R[x] > R[y])
        T[y] = x;
    else
        T[x] = y;

    if(R[x] == R[y]) ++R[y];
}

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

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

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

int main()
{
    freopen("disjoint.in","rt",stdin);
    freopen("disjoint.out","wt",stdout);

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

    for(int i = 1; i <= N; ++i)
        R[i] = 1, T[i] = i;

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

        if(tip == 1)
            unite(x, y);
        else
            if(query(x) == query(y))
                printf("DA\n");
            else
                printf("NU\n");
    }
}