#include <fstream>

using namespace std;

ifstream fin("disjoint.in");
ofstream fout("disjoint.out");

const int NMAX = 1e5+5;

int TT[NMAX], RG[NMAX];
int n,m;

int Find(int x)
{
    if(x != TT[x])
        TT[x] = Find(TT[x]);
    return TT[x];
}

void Unite(int x, int y)
{
    int parent1 = Find(x);
    int parent2 = Find(y);

    if(parent1 == parent2)
        return;

    if(RG[parent1] > RG[parent2])
        TT[parent2] = parent1;
    else
        TT[parent1] = parent2;

    if(RG[parent1] == RG[parent2])
        RG[parent2]++;
    
}

int main()
{
    int cerinta, x, y;
    fin >> n >> m;
    for(int i= 1; i<= n; ++i)
    {
        TT[i] = i;
        RG[i] = 1;
    }
    for(int i =1; i<= m; ++i)
    {
        fin >> cerinta >> x >> y;
        if(cerinta == 1)
        {
            Unite(x,y);
        }
        else
        {
            if(Find(x) == Find(y))
                fout << "DA" << '\n';
            else
                fout << "NU" << '\n';
        }
        
    }

    return 0;
}