#include <fstream>

using namespace std;

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

int n, m, cod, x, y, tati[100005];

int unionn(int x)
{
    if(tati[x] == x)
        return x;
    int aux=unionn(tati[x]);
    tati[x]=aux;
    return aux;
}

int main()
{
    f>>n>>m;
    for(int i=1; i<=n; i++)
        tati[i]=i;
    for(int i=1; i<=m; i++)
    {
        f>>cod>>x>>y;
        if(cod == 1)
        {
            tati[unionn(x)]=unionn(y);

            continue;
        }
        if(unionn(x) == unionn(y))
            g<<"DA\n";
        else
            g<<"NU\n";
    }

    return 0;
}