#include <fstream>

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

int n, m, t, x, y;
int arb[100010];

int root(int a){
    int r = a;
    while(r != arb[r])
        r = arb[r];

    while(a != arb[a]){
        int aux = a;
        a = arb[a];
        arb[aux] = r;
    }
    return r;
}

void UE(int r1, int r2){
    arb[r1] = arb[r2];
}

int main()
{
    fin >> n >> m;
    for(int i = 1; i <= n; ++i){
        arb[i] = i;
    }
    for(int i = 1; i <= m; ++i){
        fin >> t >> x >> y;
        if(t == 1){
            UE(root(x), root(y));
        }
        else {
            if(root(x) == root(y))
                fout << "DA\n";
            else
                fout << "NU\n";
        }
    }
    return 0;
}