#include <bits/stdc++.h>
#define fr first
#define sc second
#define ll long long
#define pi pair<int,int>
#define pl pair<ll,ll>
#define pd pair<double,double>
#define ld long double
#define pld pair<ld,ld>
#define lg length()
#define sz size()
#define vi vector<int>
#define vl vector<ll>
#define vp vector<pi>
#define vpl vector<pl>
#define pb push_back
#define INF 1000000005
#define LINF 1000000000000000005
using namespace std;
int n,m,p[100005];
int d[100005];
int par(int nod){
if(p[nod]==p[p[nod]])return p[nod];
else{
    p[nod] = par(p[nod]);
    return p[nod];
}
}
int unite(int x , int y){
    x = par(x);
    y = par(y);
    if(d[x] > d[y])swap(x,y);
    p[x] = y;
    d[y] += (d[x]==d[y]);
}
bool conex(int x,int y){
    return par(x) == par(y);
}
int a, b, c;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int main(){
    ios_base :: sync_with_stdio(0); cin.tie(); cout.tie();
    fin >> n;
    for(int i = 1 ; i <= n ; i++){d[i] = 1;p[i] = i;}
    fin >> m;
    for(int i = 1 ; i <= m; i++){
        fin >> a >> b >> c;
        if(a==1)unite(b,c);
        if(a==2){
            if(conex(b,c))
                fout <<"DA" << '\n';
            else
                fout <<"NU" << '\n';
        }
    }
}