#include <fstream>

using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
const int NMAX=100001;

int T[NMAX+1];

int Find(int x)
{
    if (T[x]==0) return x;
    return T[x]=Find(T[x]);
}

int main()
{
    int n,m,c,x,y;
    f>>n>>m;
    while(m--)
    {
        f>>c>>x>>y;
        int cx,cy;
        cx=Find(x);
        cy=Find(y);
        if (c==1)
        {
            T[cx]=cy;
        }
        else
            if (cx==cy)
                g<<"DA\n";
            else
                g<<"NU\n";
    }
    return 0;
}