#include <cstdio>
#pragma GCC optimize("O1")
#define BUFFER_SIZE 1400000

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

char buffer[BUFFER_SIZE];

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

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

    return number;
}

int Find(int x)
{
    int root = x, y;

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

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

        parent[x] = root;

        x = y;
    }

    return root;
}

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, BUFFER_SIZE, stdin);

    int sets = get_int(), queries = get_int(), q = -1;

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

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

        if(task == 1)
        {
            Union(x, y);
        }
        else
        {
            if(Find(x) == Find(y))
            {
                buffer[++q] = 68;
                buffer[++q] = 65;
            }
            else
            {
                buffer[++q] = 78;
                buffer[++q] = 85;
            }

            buffer[++q] = 10;
        }
    }

    buffer[++q] = 0;

    puts(buffer);

    return 0;
}