#include<cstdio>
#define N_MAX 100000
using namespace std;

int p[N_MAX+1], n, m;

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

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