#include <fstream>

#define NMAX 100001
#define MMAX 100001

using namespace std;

ifstream cin("disjoint.in");
ofstream cout("disjoint.out");

int n, m, op, maxim;
int x, y, r[NMAX];

int better_find(int x)
{
    if(x==r[x]) return x;
    r[x]=better_find(r[x]);
    return r[x];
}

void better_union(int x, int y){
    int a=better_find(x);
    int b=better_find(y);
    r[a]=b;
}

int main()
{
    cin>>n>>m;
    for(int i=1; i<=n; i++)
    {
        r[i]=i;
    }

    for(int i=1; i<=m; i++)
    {
        cin>>op;
        if(op!=3) cin>>x>>y;
        if(op==1) better_union(x, y);
        else if(op==2)
        {
            if(better_find(x)==better_find(y)) cout<<"DA"<<'\n';
            else cout<<"NU"<<'\n';
        }
    }
    return 0;
}