#include <bits/stdc++.h>
using namespace std;
const int N = 400010, NN = 1600010;
struct edge {
  int y, next;
} data[10 * N];
struct node {
  int x, id;
} l1[N], r1[N];
int n, p, M, m, flag, n1, n2, dfn[NN], low[NN], sta[NN], top, f[NN], h[NN], num,
    num1, num2, num3, a1[N], m1[N * 2], l, r;
bool insta[NN];
inline int read() {
  int x = 0;
  char ch = getchar();
  while (ch < '0' || ch > '9') ch = getchar();
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
  return x;
}
inline void addedge(int u, int v) {
  data[++num].y = v, data[num].next = h[u], h[u] = num;
}
inline int min1(int i, int j) { return i < j ? i : j; }
inline bool cmp1(node i, node j) { return i.x < j.x; }
inline bool cmp2(node i, node j) { return i.x > j.x; }
inline bool cmp3(node i, node j) { return i.id < j.id; }
void tarjan(int u) {
  dfn[u] = low[u] = ++num1, sta[++top] = u, insta[u] = true;
  for (int i = h[u], v; i != -1; i = data[i].next) {
    v = data[i].y;
    if (!dfn[v]) {
      tarjan(v);
      low[u] = min1(low[v], low[u]);
    } else if (insta[v] && dfn[v] < low[u])
      low[u] = dfn[v];
  }
  if (dfn[u] == low[u]) {
    ++num2;
    while (dfn[sta[top]] != low[sta[top]]) {
      f[sta[top]] = num2;
      insta[sta[top--]] = false;
    }
    f[u] = num2;
    insta[sta[top--]] = false;
  }
}
int main() {
  n = read(), p = read(), M = read(), m = read();
  memset(h, -1, sizeof h);
  num = 0;
  for (int i = 1, x, y; i <= n; ++i) {
    x = read(), y = read();
    addedge(x << 1 | 1, y << 1), addedge(y << 1 | 1, x << 1);
  }
  for (int i = 1; i <= p; ++i) {
    l1[i].x = read(), r1[i].x = read();
    l1[i].id = r1[i].id = i;
  }
  n1 = p << 1 | 1;
  n2 = 2 + M;
  sort(l1 + 1, l1 + p + 1, cmp2);
  sort(r1 + 1, r1 + p + 1, cmp1);
  l = r = 1;
  for (int i = 1; i <= M; ++i) {
    while (r <= p && r1[r].x == i) {
      addedge(r1[r].id << 1, n1 + n2 + i + 1);
      addedge(n1 + i + 2, r1[r].id << 1 | 1);
      ++r;
    }
    addedge(n1 + i + 1, n1 + i);
    addedge(n1 + n2 + i, n1 + n2 + i + 1);
  }
  addedge(n1 + M + 2, n1 + M + 1);
  addedge(n1 + n2 + M + 1, n1 + n2 + M + 2);
  for (int i = M; i >= 1; --i) {
    while (l <= p && l1[l].x == i) {
      addedge(l1[l].id << 1, n1 + i + 1);
      addedge(n1 + n2 + i, l1[l].id << 1 | 1);
      ++l;
    }
  }
  for (int i = 1, x, y; i <= m; ++i) {
    x = read(), y = read();
    addedge(x << 1, y << 1 | 1), addedge(y << 1, x << 1 | 1);
  }
  sort(r1 + 1, r1 + p + 1, cmp3);
  memset(dfn, 0, sizeof dfn);
  for (int i = 2; i <= n1 + 2 * n2; ++i)
    if (!dfn[i]) tarjan(i);
  flag = 1;
  for (int i = 1; i <= p; ++i)
    if (f[i << 1] == f[i << 1 | 1]) {
      flag = 0;
      break;
    }
  if (!flag) {
    printf("-1");
    return 0;
  }
  r = M, num3 = 0;
  for (int i = 1; i <= p; ++i)
    if (f[i << 1] < f[i << 1 | 1]) {
      r = min1(r, r1[i].x);
      a1[++num3] = i;
    }
  printf("%d %d\n", num3, r);
  for (int i = 1; i <= num3; ++i) printf("%d ", a1[i]);
  return 0;
}
