#include<iostream>
#include<fstream>
#include<cmath>
#include<vector>
using namespace std;

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

const int nmax = 100005;
int n,m;
vector<int> tata(nmax,-1);

int finde(int nod){
    if(tata[nod] < 0)return nod;

    else {

    int x = finde(tata[nod]);
    tata[nod] = x;
    return x;
    }

}

void Union(int x, int y){
    int tx = finde(x);
    int ty = finde(y);
    if(-tata[tx] < -tata[ty]){
        int t = tx;
        tx = ty;
        ty = t;
    }
    tata[tx] += tata[ty];
    tata[ty] = tx;
}

int main(){
    fin>>n>>m;
    for(int i = 1; i <= m; i++){
        int x,y,z;
        fin>>z>>x>>y;
        if(z == 1){
        Union(x,y);
        }
        else{
            int tx = finde(x), ty = finde(y);

            if(tx == ty)fout<<"DA\n";
            else fout<<"NU\n";
        }

    }
}