#include <cstdio>
#pragma GCC optimize("Ofast")

int parent[100001];

int Find(int x)
{
    while(parent[x] != x)
    {
        x = parent[x];
    }

    return x;
}

void Union(int x, int y)
{
    parent[Find(y)] = Find(x);
}

char buffer[200000]; int p = -1, q = -1;

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

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

    return number;
}

int main()
{
    int sets, queries, task, x, y;

    char outBuffer[300000];

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

    fread(buffer, 1, 200000, stdin);

    sets = get_int(), queries = get_int();

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

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

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

    puts(outBuffer);

    return 0;
}