#include <fstream>
#include <queue>
using namespace std;

ifstream f("disjoint.in");
ofstream g("disjoint.out");

int n, m, c, a, b;
int t[100010], rang[100010];

int parinte(int x)
{
    if(t[x]==0)
        return x;
    else{
        int aux=parinte(t[x]);
        t[x]=aux;
        return aux;
    }
}

void unire(int x, int y)
{
    int rx=parinte(x), ry=parinte(y);
    if(rx!=ry)
    {
        if(rang[rx] > rang[ry])
            t[ry]=rx;
        else
        {
            t[rx]=ry;
            if(rang[rx]==rang[ry])
                rang[ry]++;
        }
    }
}

int main()
{
    f>>n>>m;
    for(int i=1; i<=m; i++)
    {
        f>>c>>a>>b;
        if(c==1)
            unire(a, b);
        else
        {
            int ra=parinte(a), rb=parinte(b);
            if(ra==rb)
                g<<"DA"<<'\n';
            else
                g<<"NU"<<'\n';
        }
    }
    return 0;
}