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

int parent[100001], p = -1;

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

    return x;
}

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

#define SIZE 200000

__attribute__((always_inline)) void read(int &num)
{
    static char inBuffer[SIZE];

    static int p = ~-SIZE; num = 0x0;

    while(inBuffer[p] < 0x30 | inBuffer[p] > 0x39)
    {
        ++p != SIZE || (fread(inBuffer, 0x1, SIZE, stdin), p = 0x0);
    }

    while(inBuffer[p] > 0x2F & inBuffer[p] < 0x3A)
    {
        num = num * 0xA + inBuffer[p] - 0x30;

        ++p != SIZE || (fread(inBuffer, 0x1, SIZE, stdin), p = 0x0);
    }
}

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

    char outBuffer[300000];

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

    read(sets), read(queries);

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

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

        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;
}