#include <bits/stdc++.h>
using namespace std;
const int maxn = 200020;
const int Log = 19;
int head[maxn], to[2 * maxn], nxt[2 * maxn], vst[maxn], low[maxn], bel[maxn];
int top, st[maxn];
vector<int> adj[maxn];
int ind, cnt;
void dfs(int u, int pre = -1) {
  vst[u] = low[u] = ++ind;
  st[++top] = u;
  for (int e = head[u]; e != -1; e = nxt[e]) {
    int v = to[e];
    if (!vst[v])
      dfs(v, e), low[u] = min(low[u], low[v]);
    else if ((e ^ pre) != 1)
      low[u] = min(low[u], vst[v]);
  }
  if (vst[u] == low[u]) {
    ++cnt;
    do {
      bel[st[top]] = cnt;
    } while (st[top--] != u);
  }
}
int pa[maxn][Log + 1], deep[maxn];
int col[maxn], c;
void DFS(int u, int p) {
  col[u] = c;
  pa[u][0] = p;
  for (int i = 1; i <= Log; i++) pa[u][i] = pa[pa[u][i - 1]][i - 1];
  deep[u] = deep[p] + 1;
  for (int i = 0, v; i < ((int)((adj[u]).size())); i++) {
    v = adj[u][i];
    if (v != p) DFS(v, u);
  }
}
int LCA(int u, int v) {
  if (deep[u] < deep[v]) swap(u, v);
  for (int i = Log; i >= 0; i--)
    if (deep[pa[u][i]] >= deep[v]) u = pa[u][i];
  if (u == v) return u;
  for (int i = Log; i >= 0; i--)
    if (pa[u][i] != pa[v][i]) u = pa[u][i], v = pa[v][i];
  return pa[u][0];
}
int down[maxn], up[maxn];
int ans;
void ok(int u, int p) {
  for (int i = 0, v; i < ((int)((adj[u]).size())); i++) {
    v = adj[u][i];
    if (v != p) {
      ok(v, u);
      down[u] += down[v];
      up[u] += up[v];
    }
  }
  if (down[u] > 0 and up[u] > 0) ans = 0;
}
int n, m, E, u, v, q, lca;
int main() {
  scanf("%d%d%d", &n, &m, &q);
  ans = 1;
  for (int i = 1; i <= n; i++) head[i] = -1;
  for (int i = 0; i < m; i++) {
    scanf("%d%d", &u, &v);
    nxt[E] = head[u];
    to[E] = v;
    head[u] = E++;
    nxt[E] = head[v];
    to[E] = u;
    head[v] = E++;
  }
  for (int i = 1; i <= n; i++)
    if (!vst[i]) dfs(i);
  for (int i = 0; i < E; i += 2) {
    u = to[i];
    v = to[i + 1];
    u = bel[u];
    v = bel[v];
    if (u != v) adj[u].push_back(v), adj[v].push_back(u);
  }
  for (int i = 1; i <= cnt; i++)
    if (!col[i]) {
      c++;
      DFS(i, 0);
    }
  while (q--) {
    scanf("%d%d", &u, &v);
    u = bel[u];
    v = bel[v];
    if (col[u] != col[v]) {
      ans = 0;
      break;
    } else {
      lca = LCA(u, v);
      up[lca]--;
      down[lca]--;
      up[u]++;
      down[v]++;
    }
  }
  for (int i = 1; ans and i <= cnt; i++)
    if (!pa[i][0]) ok(i, 0);
  if (ans)
    puts("Yes");
  else
    puts("No");
  return 0;
}
