#include <cstdio>
#define NMAX 100005
using namespace std;

int n, m, cod, x, y;  /// numar multimi, numar operatii efectuate, codul operatiei, nr mult 1, nr mult 2
int t[NMAX], h[NMAX]; /// vectori tati, vectori inaltimi

int find_root(int x)
{
    int rx = x;
    while(t[rx] != rx)
        rx = t[rx];
    int y = x;
    while(t[y] != y) /// comprimare
    {
        int aux = t[y];
        t[y] = rx;
        y = aux;
    }
    return rx;
}

void reunion(int x, int y)
{
    int rx = find_root(x);
    int ry = find_root(y);
    if(rx != ry)
    {
        if(h[rx] < h[ry])
            t[rx] = ry;
        else
        {
            t[ry] = rx;
            if(h[rx] == h[ry])
                h[rx]++;
        }
    }
}
int main()
{
    freopen("disjoint.in", "r", stdin);
    freopen("disjoint.out", "w", stdout);
    scanf("%d %d", &n, &m);
    for(int i = 1; i <= n; i++)
        t[i] = i;
    for(int i = 0; i < m; i++)
    {
        scanf("%d %d %d", &cod, &x, &y);
        if(cod == 1)
            reunion(x,y);
        else
        {
            if(find_root(x) == find_root(y))
                printf("DA\n");
            else
                printf("NU\n");
        }
    }
    return 0;
}