#include <fstream>

using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int sef[100001];
int sefsuprem(int k)
{
    if(sef[k]==k)
        return k;
    else
        return sef[k]=sefsuprem(sef[k]);
}
void unire(int x,int y)
{
    int i,j;
    i=sefsuprem(x);
    j=sefsuprem(y);
    sef[i]=j;
}
int main()
{
    int n,m,i,j,c,x,y;
    cin>>n>>m;
    for(i=1;i<=n;i++)
        sef[i]=i;
    for(i=1;i<=m;i++)
    {
        cin>>c>>x>>y;
        if(c==1)
            unire(x,y);
        else
        {
            if(sefsuprem(x)==sefsuprem(y))
                cout<<"DA";
            else
                cout<<"NU";
        }

    }
    return 0;
}