#include <bits/stdc++.h>

using namespace std;
int t[100001];
int Find(int x)
{
    if(t[x]==x)
        return x;
    return t[x]=Find(t[x]);
}
void Union(int x, int y)
{
    int rx=Find(x), ry=Find(y);
    t[rx]=ry;
}
int main()
{
    freopen("disjoint.in", "r", stdin);
    freopen("disjoint.out", "w",stdout);
    int n, m;
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        t[i]=i;
    for(int i=1;i<=m;i++)
    {

        int cod, x, y;
        cin>>cod>>x>>y;
        if(cod==1)
        {

            Union(x,y);
        }
        else
        {
            if(Find(x)==Find(y))
                cout<<"DA\n";
            else cout<<"NU\n";
        }
    }
    return 0;
}