#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int par[N][21];
string ans = "Yes";
int n, m, q, cmp, timer;
vector<int> g[N], tree[N];
int vis[N], a[N], b[N], lvl[N];
map<pair<int, int>, int> bridge, cnt;
vector<int> low(N), disc(N), comp(N);
void dfs1(int v, int p) {
  ++timer;
  vis[v] = 1;
  low[v] = timer;
  disc[v] = timer;
  for (auto u : g[v]) {
    if (vis[u] && u != p) low[v] = min(low[v], disc[u]);
    if (vis[u] && cnt[{u, v}] > 1)
      low[v] = min(low[v], disc[u]);
    else if (!vis[u]) {
      dfs1(u, v);
      low[v] = min(low[v], low[u]);
    }
  }
  if (low[v] == disc[v] && p != 0) {
    bridge[{v, p}] = 1;
    bridge[{p, v}] = 1;
  }
}
void dfs2(int v, int cur) {
  queue<int> q;
  vis[v] = 1;
  q.push(v);
  comp[v] = cur;
  while (!q.empty()) {
    v = q.front();
    q.pop();
    for (auto u : g[v]) {
      if (!vis[u] && bridge[{v, u}]) {
        cmp++;
        tree[cmp].push_back(cur);
        tree[cur].push_back(cmp);
        dfs2(u, cmp);
      }
      if (!vis[u] && !bridge[{v, u}]) {
        vis[u] = 1;
        q.push(u);
        comp[u] = cur;
      }
    }
  }
}
void dfs3(int v, int p) {
  vis[v] = 1;
  for (auto u : tree[v]) {
    if (!vis[u]) {
      par[u][0] = v;
      lvl[u] = lvl[v] + 1;
      dfs3(u, v);
    }
  }
}
void dfs4(int v, int p) {
  vis[v] = 1;
  for (auto u : tree[v]) {
    if (!vis[u]) {
      dfs4(u, v);
      a[v] += a[u];
      b[v] += b[u];
    }
  }
  if (a[v] > 0 && b[v] > 0) ans = "No";
}
int lca(int aa, int bb) {
  if (lvl[aa] > lvl[bb]) swap(aa, bb);
  int d = lvl[bb] - lvl[aa];
  while (d) {
    int i = log2(d);
    bb = par[bb][i];
    d -= (1 << i);
  }
  if (aa == bb) return aa;
  for (int i = 20; i >= 0; i--) {
    if (par[aa][i] != -1 && par[aa][i] != par[bb][i]) {
      aa = par[aa][i];
      bb = par[bb][i];
    }
  }
  return par[aa][0];
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  memset(par, -1, sizeof(par));
  cin >> n >> m >> q;
  for (int i = 1; i <= m; i++) {
    int u, v;
    cin >> u >> v;
    cnt[{u, v}]++;
    cnt[{v, u}]++;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  memset(vis, 0, sizeof(vis));
  for (int i = 1; i <= n; i++) {
    if (vis[i]) continue;
    dfs1(i, 0);
  }
  memset(vis, 0, sizeof(vis));
  for (int i = 1; i <= n; i++) {
    if (vis[i]) continue;
    cmp++;
    dfs2(i, cmp);
  }
  memset(vis, 0, sizeof(vis));
  for (int i = 1; i < cmp + 1; i++) {
    if (vis[i]) continue;
    dfs3(i, 0);
  }
  for (int j = 1; j < 21; j++) {
    for (int i = 1; i < cmp + 1; i++) {
      if (par[i][j - 1] != -1) par[i][j] = par[par[i][j - 1]][j - 1];
    }
  }
  for (int i = 1; i <= q; i++) {
    int u, v;
    cin >> u >> v;
    u = comp[u];
    v = comp[v];
    if (u == v) continue;
    a[u]++;
    b[v]++;
    if (lca(u, v) == -1) {
      cout << "No\n";
      return 0;
    }
    a[lca(u, v)]--;
    b[lca(u, v)]--;
  }
  memset(vis, 0, sizeof(vis));
  for (int i = 1; i < cmp + 1; i++) {
    if (vis[i]) continue;
    dfs4(i, 0);
  }
  cout << ans << endl;
  return 0;
}
