Enemy of My Enemy

There is a saying, "the enemy of my enemy is my friend." With this saying, we can determine the relationship of any two people. Even if A and C have no direct relationship, if A and B have a relationship and B and C have a relationship, then A and C also have an indirect relationship. This is summarized as follows.

1. If A and B are enemies and B and C are enemies, then A and C are friends.
2. If A and B are enemies and B and C are friends, then A and C are enemies.
3. If A and B are friends and B and C are friends, then A and C are friends.

Based on this, given the relationships between people, let us determine the relationship between specific people.

The first line contains the number of people $N \, (2 \leq N \leq 100,000)$, the number of relationships $M \, (0 \leq M \leq 100,000)$, and the number of relationships to answer $K \, (1 \leq K \leq 100,000)$.

Then $M$ lines follow, each containing $t \in \{0, 1\}$, $a$, $b$ $(1 \leq a, b \leq N, a \neq b)$.

If $t = 0$, it means $a$ and $b$ are friends.

If $t = 1$, it means $a$ and $b$ are enemies.

Then $K$ lines follow, each containing a query $a$, $b$ $(1 \leq a, b \leq N, a \neq b)$.

For each query, output the relationship between $a$ and $b$ on its own line.

If $a$ and $b$ are not related at all, output 'Unknown'.

If $a$ and $b$ are friends, output 'Friend'.

If $a$ and $b$ are enemies, output 'Enemy'.

If $a$ and $b$ are both friends and enemies, output 'Error'.

In the second example, 1 and 2 are directly enemies, but 1 and 3 are friends and 2 and 3 are friends, so they are indirectly friends. Therefore, 1 and 2 are both enemies and friends, resulting in Error.