#include <cstdio>
#define NMAX 100002

using namespace std;

int n,q;
int t[NMAX];

int find_t(int nod)
{
    if(nod==t[nod])
        return nod;
    return t[nod]=find_t(t[nod]);
}

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

    int x,y,cod;

    scanf("%d%d", &n, &q);

    for(int i=1; i<=n; i++)
        t[i]=i;
    while(q--)
    {
        scanf("%d%d%d", &cod, &x, &y);
        if(cod==1)
        {
            t[find_t(y)]=find_t(x);
        }
        else
        {
            int r1=find_t(x);
            int r2=find_t(y);
            if(r1==r2)
            {
                printf("DA\n");
            }
            else
            {
                printf("NU\n");
            }
        }

    }
    return 0;
}