#include<iostream>
#include<stdio.h>
using namespace std;
int n, m, i, op, tata[100001], x, y;

int findtata(int x)
{
    if(x == tata[x])
        return x;
    else
        return tata[x] = findtata(tata[x]);
}

void uniune(int x, int y)
{
    int sefx, sefy;
    sefx = findtata(x);
    sefy = findtata(y);
    tata[sefx] = sefy;
}

int main()
{
    freopen("disjoint.in", "r", stdin);
    freopen("disjoint.out", "w", stdout);

    cin >> n >> m;

    for(i = 1; i <= n; i ++)
        tata[i] = i;
    for(i = 1; i <= m; i ++)
    {
        cin >> op >> x >> y;
        if(op == 1)
            uniune(x, y);
        else
            if(findtata(x) == findtata(y))
                cout << "DA" << endl;
        else
            cout << "NU" << endl;
    }
    return 0;
}