#include <bits/stdc++.h>

#pragma optimize GCC ("Ofast")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

///#include <tryhardmode>
///#include <GODMODE::ON>

using namespace std;

ifstream fin ("disjoint.in");
ofstream fout ("disjoint.out");

#define cin fin
#define cout fout

const int NMAX=1e5+5;

int t[NMAX];
int p[NMAX];

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

void solve(int x,int y)
{
    x=root(x);
    y=root(y);
    if(x==y)
        return ;
    if(p[x]<p[y])
        swap(x,y);
    t[y]=x;
    p[x]+=p[y];
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    int n,m,i,j;
    cin>>n>>m;
    for(i=1;i<=n;i++)
    {
        t[i]=i;
        p[i]=1;
    }
    for(i=1;i<=m;i++)
    {
        int type,x,y;
        cin>>type>>x>>y;
        if(type==1)
        {
            if(root(x)!=root(y))
                solve(x,y);
        }
        else
        {
            if(root(x)!=root(y))
                cout<<"NU\n";
            else
                cout<<"DA\n";
        }
    }
    cin.close();
    cout.close();
    return 0;
}