#include <stdio.h>

int parent[100001], rank[100001], p = -1, q = -1;

char buffer[1400000], outBuffer[300000];

__attribute__((always_inline)) int get_int()
{
    int number = 0;

    for(++p; buffer[p] > 47; ++p)
    {
        number = number * 10 + buffer[p] - 48;
    }

    return number;
}

__attribute__((always_inline)) int Find(int x)
{
    int root, y;

    for(root = x; parent[root] != root; root = parent[root]);

    for(; parent[x] != x;)
    {
        y = parent[x];

        parent[x] = root;

        x = y;
    }

    return root;
}

__attribute__((always_inline)) void Union(int x, int y)
{
    if(rank[x] > rank[y]) parent[y] = x;

    else parent[x] = y;

    if(rank[x] == rank[y]) ++rank[y];
}

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

    fread(buffer, 1, 1400000, stdin);

    int N = get_int(), M = get_int();

    for(int i = 1; i <= N; ++i)
    {
        parent[i] = i;
    }

    for(int i = 1; i <= M; ++i)
    {
        int task = get_int(), x = get_int(), y = get_int();

        if(task == 2)
        {
            if(Find(x) == Find(y))
            {
                outBuffer[++q] = 'D';
                outBuffer[++q] = 'A';
                outBuffer[++q] = '\n';
            }
            else
            {
                outBuffer[++q] = 'N';
                outBuffer[++q] = 'U';
                outBuffer[++q] = '\n';
            }
        }
        else
        {
            Union(Find(x), Find(y));
        }
    }

    puts(outBuffer);

    return 0;
}