#include<cstdio>
#define NMAX 100000+5
using namespace std;
int N,M;
int root[NMAX],rang[NMAX];
void unite(int a,int b)
{
    if(rang[a]<rang[b]) //unim in arborele de rang mai mare
        root[a]=b;
    else root[b]=a;
    if(rang[a]==rang[b]) rang[a]++;
}
int find(int a)
{
    int R,b;
    for(R=a;root[R]!=R;R=root[R]); //caut radacina
    for(;root[a]!=R;) //compresia drumurilor
    {
        b=root[a];
        root[a]=R;
        a=b;
    }
    return R;
}
int main()
{
    int i,a,b,t;
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    scanf("%d%d",&N,&M);
    for(i=1;i<=N;i++)
    {
        root[i]=i; rang[i]=1;
    }
    for(;M;--M)
    {
        scanf("%d%d%d",&t,&a,&b);
        if(t==1)
        {
            unite(a,b);
            continue;
        }
        if(find(a)==find(b)) printf("DA\n");
        else printf("NU\n");
    }
    return 0;
}