#include <bits/stdc++.h>

using namespace std;
struct DSU
{
    vector<int>Parent;
    vector<int>Rank;
    DSU(int n)
    {
        Parent.assign(n+1,0);
        Rank.assign(n+1,1);
        for(int i=0;i<=n;i++)
        Parent[i]=i;
    }
    int getparent(int a)
    {
        if(a==Parent[a])
        return a;
        return Parent[a]=getparent(Parent[a]);
    }
    void unite(int a,int b)
    {
        a=getparent(a);
        b=getparent(b);
        if(a!=b)
        {
            if(Rank[a]<Rank[b])
            {
                Parent[a]=b;
            }
            else if(Rank[a]>Rank[b])
            {
                Parent[b]=a;
            }
            else if(Rank[a]==Rank[b])
            {
                Rank[a]++;
                Parent[b]=a;
            }
        }
    }
};
int main()
{
    ifstream cin("disjoint.in");
    ofstream cout("disjoint.out");
    int n,m;
    cin>>n>>m;
    DSU h(n+1);
    while(m--)
    {
        int cer,a,b;
        cin>>cer>>a>>b;
        if(cer==1)
        {
            h.unite(a,b);
        }
        else
        {
            if(h.getparent(a)==h.getparent(b))
            {
                cout<<"DA";
            }
            else
            cout<<"NU";
            cout<<'\n';
        }
    }
    return 0;
}