#include <fstream>

using namespace std;

const int nmax=2e5+7;
int parent[nmax],sizes[nmax];
int n,q;

ifstream cin("disjoint.in");
ofstream cout("disjoint.out");

void init()
{
    for(int i=1; i<=n; i++)
    {
        parent[i]=i;
        sizes[i]=1;
    }
}

int find(int x)
{
    if(x==parent[x])
        return x;
    return parent[x]=find(parent[x]);
}

void unite(int u,int v)
{
    u=find(u);
    v=find(v);
    if(u==v)
        return;
    if(sizes[v]>sizes[u])
        swap(u,v);
    parent[v]=u;
    sizes[u]+=sizes[v];
}

int main()
{
    int c,u,v,i;
    cin>>n>>q;
    init();
    for(i=1; i<=q; i++)
    {
        cin>>c>>v>>u;
        if(c==1)
            unite(u,v);
        if(c==2)
        {
            if(find(u)==find(v))
                cout<<"DA";
            else
                cout<<"NU";
            cout<<endl;
        }
    }
    return 0;
}