#include <bits/stdc++.h>
using namespace std;
constexpr int inf = 2e9;
int S, T;
struct MF {
	static constexpr int N = 2005;
	struct Edge {
		int v, f;
	};
	vector<int> e[N];
	vector<Edge> l;
	int dis[N];
	bool BFS() {
		memset(dis, -1, sizeof dis);
		queue<int> Q;
		Q.push(S);
		dis[S] = 0;
		while (!Q.empty()) {
			int u = Q.front();
			Q.pop();
			for (int id : e[u]) {
				auto [v, f] = l[id];
				if (f && dis[v] == -1) {
					dis[v] = dis[u] + 1;
					Q.push(v);
				}
			}
		}
		return dis[T] != -1;
	}
	int cur[N];
	int DFS(int u, int limit) {
		if (u == T) return limit;
		int flow = 0;
		for (int i = cur[u]; i < e[u].size() && flow < limit; i = max(i + 1, cur[u])) {
			cur[u] = i + 1;
			int id = e[u][i];
			auto &[v, f] = l[id];
			if (f && dis[v] == dis[u] + 1) {
				int fl = DFS(v, min(limit - flow, f));
				flow += fl;
				f -= fl;
				l[id ^ 1].f += fl;
				if (!fl) dis[v] = -1;
			}
		}
		return flow;
	}
	int Dinic() {
		int flow = 0, fs = 0;
		while (BFS()) {
			fs = 1;
			memset(cur, 0, sizeof cur);
			flow += DFS(S, inf);
		}
		return fs ? flow : inf;
	}
	void add(int u, int v, int f) {
		e[u].push_back(l.size());
		l.push_back({v, f});
		e[v].push_back(l.size());
		l.push_back({u, 0});
	}
	vector<array<int, 2>> cut() {
		int w = Dinic();
		if (w == inf) {
			cout << -1 << "\n";
			exit(0);
		}
		cerr << "w = " << w << endl;
		vector<array<int, 2>> res;
		for (int i = 0; i < l.size(); i += 2) {
			int u = l[i + 1].v, v = l[i].v;
			if (dis[u] != -1 && dis[v] == -1) {
				res.push_back({u, v});
			}
		}
		return res;
	}
} g;
int main() {
	int n, m, K;
	cin >> n >> m >> K;
	int s, t;
	cin >> s >> t, s--, t--;
	auto id = [&](int u, int level, int op) {
		return u * K * 2 + level * 2 + op;
	};
	vector<int> w(n);
	for (int &x : w) {
		cin >> x;
	}
	vector<array<int, 2>> edges(m);
	for (auto &[u, v] : edges) {
		cin >> u >> v;
		u--;
		v--;
	}
	for (int k = 0; k < K; k++) {
		for (int u = 0; u < n; u++) {
			g.add(id(u, k, 0), id(u, k, 1), w[u]);
			if (k + 1 < K) g.add(id(u, k, 0), id(u, k + 1, 1), inf);
		}
		for (auto [u, v] : edges) {
			g.add(id(u, k, 1), id(v, k, 0), inf);
		}
		if (k + 1 < K) g.add(id(t, k, 1), id(t, k + 1, 1), inf);
	}
	S = id(s, 0, 0), T = id(t, K - 1, 1);
	auto res = g.cut();
	vector<int> vec;
	for (auto [u, v] : res) {
		vec.push_back(u / (K * 2));
	}
	cout << vec.size() << "\n";
	for (int i = 0; i < vec.size(); i++) {
		cout << vec[i] + 1 << " \n"[i + 1 == vec.size()];
	}
	return 0;
}