#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <atcoder/maxflow>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

const ll inf = 1e18;
using P = pair<string, int>;
const string Goal = "Goal";   
const string Action = "Action";   
const string Preparation = "Preparation";   

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n, m, k, p; cin >> n >> m >> k >> p;
    vector<ll> e(n);
    vector<ll> f(m);
    vector<ll> v(k);
    for(int i = 0; i < n; i++) cin >> e[i];
    for(int i = 0; i < m; i++) cin >> f[i];
    for(int i = 0; i < k; i++) cin >> v[i];
    auto goal_idx = [&](int i){
        return i+1;
    };
    auto action_idx = [&](int j){
        return j+n+1;
    };
    auto prepare_idx = [&](int k){
        return k+n+m+1;
    };
    atcoder::mf_graph<ll> mf(n+m+k+2);
    int s = 0, t = n+m+k+1;
    for(int i = 0; i < n; i++) mf.add_edge(goal_idx(i), t, e[i]);
    for(int j = 0; j < m; j++) mf.add_edge(s, action_idx(j), f[j]);
    for(int kk = 0; kk < k; kk++) mf.add_edge(s, prepare_idx(kk), v[kk]);
    for(int i = 0; i < n; i++){
        int l; cin >> l;
        for(int j = 0; j < l; j++){
            int a; cin >> a; a--;
            mf.add_edge(prepare_idx(a), goal_idx(i), inf);
        }
    }
    for(int k = 0; k < p; k++){
        int i, j; cin >> i >> j; i--; j--;
        mf.add_edge(action_idx(j), goal_idx(i), inf);
    }
    ll ans = accumulate(e.begin(), e.end(), 0ll) + accumulate(f.begin(), f.end(), 0ll);
    ans -= mf.flow(s, t);
    cout << ans << endl;
    auto reachable = mf.min_cut(s);
    vector<P> order;
    for(int kk = 0; kk < k; kk++){
        if(!reachable[prepare_idx(kk)]) order.push_back(P(Preparation, kk));
    }
    for(int j = 0; j < m; j++){
        if(reachable[action_idx(j)]) order.push_back(P(Action, j));
    }
    for(int i = 0; i < n; i++){
        if(!reachable[goal_idx(i)]) order.push_back(P(Goal, i));
    }
    cout << order.size() << endl;
    for(auto [kind, idx]: order) cout << kind << ' ' << idx+1 << endl;
}