#include <cstdio>

using namespace std;

int t[100001],h[100001];

int find_(int x)
{
    if (t[x]==x) return x;
    t[x]=find_(t[x]);
    return t[x];
}

int union_(int x,int y)
{
    int a=find_(x),b=find_(y);
    if (h[a]<h[b]) t[a]=b;
    else
    {
        t[b]=a;
        if (h[a]==h[b]) h[a]++;
    }
}

int main()
{
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    int n,m;
    scanf("%d %d",&n,&m);
    for (int i=1;i<=n;i++)
        t[i]=i;
    for (int i=1;i<=m;i++)
    {
        int a,b,c;
        scanf("%d %d %d",&a,&b,&c);
        if (a==1)
        {
            union_(b,c);
        }
        if (a==2)
        {
            if (find_(b)==find_(c))
                printf("DA\n");
            else printf("NU\n");
        }
    }
}