#include <bits/stdc++.h>
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1e14;
const int INF=2100000000;
const ll mod=998244353;
#define rep(i,a) for (ll i=0;i<a;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}

#include <atcoder/maxflow>
using namespace atcoder;

void solve();

// ってか
int main() {
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	int N,M,K,P;
	cin>>N>>M>>K>>P;
	int S=N+M+K,T=S+1;
	mf_graph<ll> G(T+1);
	vector<ll> E(N),F(M),V(K);
	rep(i,N) cin>>E[i];
	rep(i,M) cin>>F[i];
	rep(i,K) cin>>V[i];
	ll ans=0;
	rep(i,N) G.add_edge(S,i,0),G.add_edge(i,T,E[i]),ans+=E[i];
	rep(i,M) G.add_edge(S,i+N,F[i]),G.add_edge(i+N,T,0),ans+=F[i];
	rep(i,K) G.add_edge(S,i+N+M,V[i]),G.add_edge(i+N+M,T,0);
	rep(i,N){
		int L;
		cin>>L;
		rep(j,L){
			int a;
			cin>>a;
			G.add_edge(a+N+M-1,i,ILL);
		}
	}
	rep(i,P){
		int I,J;
		cin>>I>>J;
		I--,J--;
		G.add_edge(J+N,I,ILL);
	}
	ll fl=G.flow(S,T);
	cout<<ans-fl<<"\n";
	auto p=G.min_cut(S);
	vector<pair<string,int>> mo;
	rep(i,K){
		if(!p[i+N+M]) mo.push_back({"Preparation",i+1});
	}rep(i,N){
		if(!p[i]) mo.push_back({"Goal",i+1});
	}rep(i,M){
		if(p[i+N]) mo.push_back({"Action",i+1});
	}
	cout<<mo.size()<<"\n";
	for(auto x:mo){
		cout<<x.first<<" "<<x.second<<"\n";
	}
}