#include<cstdio>
using namespace std;
const int NMAX = 100005;
int N,M,i,Key,X,Y,Father[NMAX],Rank[NMAX];
void Unite(int X,int Y)
{
    if(Rank[X]<Rank[Y]) Father[X]=Y;
    else if(Rank[X]>Rank[Y]) Father[Y]=X;
    else Father[X]=Y,Rank[Y]++;
}
int Find(int X)
{
    if(X!=Father[X]) Father[X]=Find(Father[X]);
    return Father[X];
}
int main()
{
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    scanf("%d%d",&N,&M);
    for(i=1;i<=N;i++)
    {
        Father[i]=i;
        Rank[i]=1;
    }
    for(i=1;i<=M;i++)
    {
        scanf("%d%d%d",&Key,&X,&Y);
        if(Key==1) Unite(Find(X),Find(Y));
        else
        {
            if(Find(X)==Find(Y)) printf("DA\n");
            else printf("NU\n");
        }
    }
    return 0;
}