#include <cstdio>
#define NMAX 100005

using namespace std;

int t,x,y,n,m;
int mul[NMAX];

int tata(int nod)
{
    if(mul[nod] == nod) return nod;
    mul[nod]=tata(mul[nod]);
    return mul[nod];
}

void reuneste(int x,int y)
{
    mul[tata(x)] = tata(y);
}

int main()
{
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(int i = 1; i <= n; ++i) mul[i]=i;

    for(int i = 1; i <= m; ++i)
    {
        scanf("%d%d%d",&t,&x,&y);
        if (t == 1)
        {
            reuneste(x,y);
        }
        else
        {
            if (tata(x) != tata(y)) printf("NU\n");
                else printf("DA\n");
        }
    }
    return 0;
}