#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
const int lgN = 20;
int n, m, q;
bool vis[N], isbridge[N];
vector<int> g[N], tree[N];
queue<int> Q[N];
int arr[N], comp[N], comp2[N], U[N], V[N], DP[lgN][N], up[N], down[N], level[N];
int CNO, T;
bool ok;
int adj(int u, int e) { return u == U[e] ? V[e] : U[e]; }
int markbridges(int i, int edge) {
  comp[i] = CNO;
  vis[i] = 1;
  arr[i] = T++;
  int minT = arr[i];
  for (int e : g[i]) {
    int v = adj(i, e);
    if (!vis[v]) {
      minT = min(minT, markbridges(v, e));
    } else if (e != edge) {
      minT = min(minT, arr[v]);
    }
  }
  if (edge != -1 && minT == arr[i]) isbridge[edge] = true;
  return minT;
}
void bridgetree(int i) {
  vis[i] = 1;
  int curcomp = CNO;
  Q[curcomp].push(i);
  while (!Q[curcomp].empty()) {
    int x = Q[curcomp].front();
    Q[curcomp].pop();
    comp2[x] = curcomp;
    for (int e : g[x]) {
      int v = adj(x, e);
      if (vis[v]) continue;
      if (isbridge[e]) {
        CNO++;
        tree[curcomp].push_back(CNO);
        tree[CNO].push_back(curcomp);
        bridgetree(v);
      } else {
        vis[v] = 1;
        Q[curcomp].push(v);
      }
    }
  }
}
void dfs1(int i) {
  vis[i] = 1;
  for (int v : tree[i])
    if (!vis[v]) {
      DP[0][v] = i;
      level[v] = level[i] + 1;
      dfs1(v);
    }
}
int lca(int u, int v) {
  if (level[u] < level[v]) swap(u, v);
  int dif = level[u] - level[v];
  for (int i = lgN - 1; i >= 0; i--)
    if (dif & (1 << i)) u = DP[i][u];
  if (u == v) return u;
  for (int i = lgN - 1; i >= 0; i--)
    if (DP[i][u] != DP[i][v]) {
      u = DP[i][u];
      v = DP[i][v];
    }
  return DP[0][u];
}
void dfs2(int i) {
  vis[i] = 1;
  for (int v : tree[i])
    if (!vis[v]) {
      dfs2(v);
      up[i] += up[v];
      down[i] += down[v];
    }
  if (up[i] > 0 && down[i] > 0) ok = false;
}
int main(void) {
  std::ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int x, y;
  cin >> n >> m >> q;
  for (int i = 0; i < m; i++) {
    cin >> x >> y;
    g[x].push_back(i);
    g[y].push_back(i);
    U[i] = x;
    V[i] = y;
  }
  for (int i = 1; i <= n; i++)
    if (!vis[i]) {
      markbridges(i, -1);
      CNO++;
    }
  memset(vis, 0, sizeof(vis));
  CNO = 0;
  for (int i = 1; i <= n; i++)
    if (!vis[i]) {
      bridgetree(i);
      CNO++;
    }
  memset(vis, 0, sizeof(vis));
  for (int i = 0; i < CNO; i++)
    if (!vis[i]) {
      level[i] = 0;
      DP[0][i] = i;
      dfs1(i);
    }
  for (int i = 1; i < lgN; i++)
    for (int j = 0; j < CNO; j++) DP[i][j] = DP[i - 1][DP[i - 1][j]];
  while (q--) {
    cin >> x >> y;
    if (comp[x] != comp[y]) {
      cout << "No\n";
      return 0;
    }
    x = comp2[x];
    y = comp2[y];
    if (x == y) continue;
    up[x]++;
    down[y]++;
    int lc = lca(x, y);
    up[lc]--;
    down[lc]--;
  }
  ok = true;
  memset(vis, 0, sizeof(vis));
  for (int i = 0; i < CNO; i++) dfs2(i);
  cout << (ok == true ? "Yes\n" : "No\n");
  return 0;
}
