#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]) {root[a]=b; return;}
    if(rang[a]>rang[b]) {root[b]=a; return;}
    if(rang[a]==rang[b]) {root[a]=b; rang[b]++; return;}
}
int find(int a)
{
    if(a!=root[a]) root[a]=find(root[a]);
    return root[a];
}
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(find(a),find(b));
            continue;
        }
        if(find(a)==find(b)) printf("DA\n");
        else printf("NU\n");
    }
    return 0;
}