#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200005;
int head[MAXN], edge[MAXN << 1], next1[MAXN << 1], esz;
int head2[MAXN], edge2[MAXN << 1], next2[MAXN << 1], esz2;
int fa[4][MAXN], dp[MAXN][21], cent[MAXN];
vector<pair<int, int> > H;
void addedge(int u, int v) {
  edge[esz] = v;
  next1[esz] = head[u];
  head[u] = esz++;
}
void addedge2(int u, int v) {
  edge2[esz2] = v;
  next2[esz2] = head2[u];
  head2[u] = esz2++;
}
int mfind(int x, int id) {
  if (fa[id][x] == x) return x;
  return fa[id][x] = mfind(fa[id][x], id);
}
void dfs(int u, int p) {
  cent[u] = cent[p] + 1;
  dp[u][0] = p;
  for (int i = head[u]; i + 1; i = next1[i]) {
    int v = edge[i];
    if (v == p) continue;
    if (cent[v]) {
      H.push_back(make_pair(u, v));
      continue;
    }
    addedge2(u, v);
    dfs(v, u);
  }
}
void build(int n) {
  for (int j = 1; j < 21; j++)
    for (int i = 1; i <= n; i++) dp[i][j] = dp[dp[i][j - 1]][j - 1];
}
int LCA(int u, int v) {
  if (cent[u] < cent[v]) swap(u, v);
  int cha = cent[u] - cent[v];
  for (int i = 0; i < 21; i++) {
    if ((1 << i) & cha) {
      u = dp[u][i];
    }
  }
  if (u == v) return u;
  for (int i = 20; i >= 0; i--) {
    if (dp[u][i] != dp[v][i]) {
      u = dp[u][i];
      v = dp[v][i];
    }
  }
  return dp[u][0];
}
void solve(int u, int pre) {
  while (u != pre) {
    fa[1][u] = pre;
    u = mfind(dp[u][0], 1);
  }
}
int main() {
  int n, m, q;
  memset(head, -1, sizeof(head));
  memset(head2, -1, sizeof(head2));
  scanf("%d%d%d", &n, &m, &q);
  for (int i = 1; i <= n; i++) {
    fa[0][i] = fa[1][i] = fa[2][i] = fa[3][i] = i;
  }
  for (int i = 0; i < m; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    addedge(u, v);
    addedge(v, u);
    fa[0][mfind(u, 0)] = mfind(v, 0);
  }
  for (int i = 1; i <= n; i++)
    if (cent[i] == 0) dfs(i, 0);
  build(n);
  int L = H.size();
  for (int i = 0; i < L; i++) {
    int u = H[i].first;
    int v = H[i].second;
    u = mfind(u, 1);
    v = mfind(v, 1);
    if (u == v) continue;
    int pre = LCA(u, v);
    pre = mfind(pre, 1);
    solve(u, pre);
    solve(v, pre);
  }
  int flag = 0;
  while (q--) {
    int u, v;
    scanf("%d%d", &u, &v);
    if (flag) continue;
    if (mfind(u, 0) != mfind(v, 0)) {
      flag = 1;
      continue;
    }
    u = mfind(u, 1);
    v = mfind(v, 1);
    int pre = LCA(u, v);
    pre = mfind(pre, 1);
    while (u != pre) {
      u = mfind(u, 2);
      if (cent[u] <= cent[pre]) {
        break;
      }
      if (u != mfind(u, 3)) {
        flag = 1;
        break;
      }
      int root = mfind(dp[u][0], 1);
      fa[2][u] = mfind(root, 2);
      u = fa[2][u];
      if (cent[u] <= cent[pre]) break;
    }
    while (v != pre) {
      v = mfind(v, 3);
      if (cent[v] <= cent[pre]) {
        break;
      }
      if (v != mfind(v, 2)) {
        flag = 1;
        break;
      }
      int root = mfind(dp[v][0], 1);
      fa[3][v] = mfind(root, 3);
      v = fa[3][v];
      if (cent[v] <= cent[pre]) break;
    }
  }
  if (flag)
    printf("No\n");
  else
    printf("Yes\n");
  return 0;
}
