#include <cstdio>
#define MAXN 100100
int TT[MAXN], RG[MAXN], n, m;
void unite(int x, int y)
{
    if(RG[x]>RG[y])
        TT[y]=x;
    else
        TT[x]=y;
    if(RG[x]==RG[y])
        RG[y]++;
}
int find(int x)
{
    int R, y;
    for(R=x;R!=TT[R];R=TT[R]);
    for(;TT[x]!=x;)
    {
        y=TT[x];
        TT[x]=R;
        x=y;
    }
    return R;
}
void rezolva_problema()
{
    int tip, x, y,i;
    scanf("%d%d", &n, &m);
    for(i=1;i<=n;++i)
    {
        TT[i]=i;
        RG[i]=1;
    }
    for(i=1;i<=m;++i)
    {
        scanf("%d%d%d", &tip, &x, &y);
        if(tip==1)
            unite(find(x), find(y));
        else
        {
            if(find(x)==find(y))
                printf("DA\n");
            else
                printf("NU\n");
        }
    }
}
int main()
{
    freopen("disjoint.in", "r", stdin);
    freopen("disjoint.out", "w", stdout);
    rezolva_problema();
    return 0;
}