Victory Through Synergy

Johnny has been placed in a fantasy soccer league and wants the strongest possible team. There are no goalkeepers in this league.

His team has 10 players. For each player, he knows the country, the league, and the team.

Johnny knows these synergy rules:

1. Two players from the same country are linked with a synergy score of $1$.
2. Two players in the same league are linked with a synergy score of $1$.
3. Two players on the same team are linked with a synergy score of $2$.
4. Two players from the same country and in the same league are linked with a synergy score of $2$.
5. Two players from the same country and on the same team are linked with a synergy score of $3$.

A team can only be in one league, and no two teams share a name unless they are the same team.

The players are placed on the 10 nodes of an undirected graph called the formation. Each node holds exactly one player. The degree of a node is the number of links attached to it. The synergy score of a node is the sum of the synergy scores of all links attached to it. A player gets synergy from the players on the nodes linked to that player.

A team is perfect if and only if every player sits on a node whose synergy score is at least the node's degree.

Given a formation and Johnny's players, determine whether Johnny can arrange the players into a perfect team.

The first line contains an integer $c$ ($0 \leq c \leq 45$), the number of links in the formation.

Each of the next $c$ lines contains two integers $a$ and $b$ ($0 \leq a, b < 10$, $a \neq b$), meaning nodes $a$ and $b$ are linked.

Each of the next 10 lines contains four strings: player name, country, league, and team. Each string is non-empty, has no spaces, and is at most 15 characters long. The strings are separated by single spaces.

Print yes if Johnny can arrange the players into a perfect team. Otherwise, print no.