#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int N,M,TT[100002];
int Father(int x)
{
    while(TT[x]!=x)
        x=TT[x];
    return x;
}
void Unite(int x,int y)
{
    TT[x]=y;
}
void Solve()
{
    int i;
    f>>N>>M;
    for(i=1;i<=N;i++)
        TT[i]=i;
    for(i=1;i<=M;i++)
    {
        int cod,x,y;
        f>>cod>>x>>y;
        if(cod==1)
            Unite(Father(x),Father(y));
        else
        {
            if(Father(x)==Father(y))
                g<<"DA\n";
            else
                g<<"NU\n";
        }
    }
}
int main()
{
    Solve();
    return 0;
}