#include <bits/stdc++.h>

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

int n, m;
std::vector<int> dad(100001);
std::vector<int> rank(100001);


int get_dad(int x){
    while(x != dad[x])
        x = dad[x];
    return x;
}

void unite(int x, int y){
    int dad_x = get_dad(x), dad_y = get_dad(y);
    if(rank[dad_x] < rank[dad_y]){
        dad[dad_x] = dad_y;
        rank[dad_y]++;
    }
    else
    {
        dad[dad_y] = dad_x;
        rank[dad_x]++;
    }
}

void find(int x, int y){
    if(get_dad(x) == get_dad(y))
        fout << "DA\n";
    else
        fout << "NU\n";
}


int main()
{
    int i, cod, x, y;
    fin >> n >> m;
    for(i = 1; i <= n; i++){
        //initial fiecare e o multime
        dad[i] = i;
        rank[i] = 1;
    }
    for(i = 0; i < m; i++){
        fin >> cod >> x >> y;
        if(cod == 1)
            unite(x, y);
        else
            find(x, y);
    }
    return 0;
}