Headline Heat

The German ICPC scene is widely considered one of the most competitive. At least, that is what we tell our students. Countless rivalries form a web of envy, despair, glory, and triumph, played out through the endless echoes of two scoreboards: Winter Contest and GCPC. Participants tend to forget the grudges of their predecessors, but we coaches keep these petty conflicts alive between long forgotten teams. Aiming for perfect balance, we express our dedication to coaching through furious outcries on social media against every unfair news article. That is, a coach gets angry if a news article mentions a rival university more often than their own.

To calm this ocean of rage, a newly appointed authority is tasked with proofreading media coverage of GCPC and Winter Contest to prevent uneven coverage.

The input consists of:

• One line with the number of universities $n$, rivalries $m$, and articles $k$. ($1\leq n,m,k\leq 10^5$)
• $n$ lines containing the name of a university $p_i$.
• $m$ lines containing two integers $u,v$, meaning that universities $u$ and $v$ are rivals. ($1\leq u,v \leq n, u\neq v$)
• $k$ lines containing a news article $t_i$.

If university $u$ is a rival of university $v$, then $v$ is also a rival of $u$. No rivalry appears twice.

Names and articles are strings of lowercase Latin letters and spaces. The first and last character of a name or article are never a space. Names can overlap and be contained in other names.

The summed length of all names and articles is at most $10^6$, i.e. $\sum_{i=1}^{n} |p_i| + \sum_{i=1}^{k} |t_i| \leq 10^6$.

For each article, output no if it will draw the wrath of at least one coach, and yes otherwise.