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

int father[NMAX], n, m;

void Init(int n)
{
    for(int i=1; i<=n; i++)
        father[i] = i;
}

int Find(int x)
{
    int r = x, aux;
    while(father[r] != r)
        r = father[r];
    while(father[x] != r)
    {
        aux = father[x];
        father[x] = r;
        x = aux;
    }
    return r;
}

void Union(int x, int y)
{
    int rx = Find(x), ry = Find(y);
    father[rx] = ry;
}

int main()
{
    int op, x, y, i;
    FILE *fin, *fout;
    fin = fopen("disjoint.in","r");
    fout = fopen("disjoint.out","w");
    fscanf(fin,"%d%d",&n,&m);
    Init(n);
    for(i=1; i<=m; i++)
    {
        fscanf(fin,"%d%d%d",&op,&x,&y);
        if(op == 1)
            Union(x,y);
        else
            if(Find(x) == Find(y))
                fprintf(fout,"DA\n");
            else fprintf(fout,"NU\n");
    }
    fclose(fin);
    fclose(fout);
    return 0;
}