#include<cstdio>
#include<fstream>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<bitset>
#include<deque>
#include<queue>
#include<set>
#include<map>
#include<cmath>
#include<cstring>
#include<ctime>
#include<cstdlib>
#include<unordered_map>

#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second

using namespace std;

const int nmax = 100005;

int n, m, i, op, x, y, f[nmax];

int find(int x)
{
    if(x != f[x]) f[x] = find(f[x]);
    return f[x];
}

void unite(int x, int y)
{
    f[x] = y;
}

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

    scanf("%d%d", &n, &m);

    for(i = 1; i <= n; i++)
        f[i] = i;

    for(; m; m--)
    {
        scanf("%d%d%d", &op, &x, &y);

        if(op == 1) unite(find(x), find(y));
        else
        {
            if(find(x) == find(y)) printf("DA\n");
            else printf("NU\n");
        }
    }

    return 0;
}