#include <bits/stdc++.h>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
#define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(int)(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
//int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
//int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
const ll MOD = 1000000007;
// const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'

int n, m, h, k;

struct edge {
    int to, cost, time, com;
    edge (int to, int cost, int time, int com) 
    :to(to), cost(cost), time(time), com(com) {}
};

vector<vector<edge>> G;

ll dijkstra(int s, int t, int syu) {
    vll dist(n, vl(h + 1, INF));
    dist[s][0] = 0;

    using P = pair<ll, pii>;
    priority_queue<P, vector<P>, greater<P>> pq;
    pq.push(P(0, pii(s, 0)));
    while (pq.size()) {
        P temp = pq.top();
        pq.pop();
        ll cost = temp.first;
        int u = temp.second.first, time = temp.second.second;
        if (dist[u][time] < cost) continue;
        for (edge e: G[u]) {
            int v = e.to;
            int ntime = time + e.time;
            ll ncost = cost + e.cost;
            if (syu & (1 << e.com)) ncost = cost;
            if (ntime > h) continue;
            if (dist[v][ntime] > ncost) {
                dist[v][ntime] = ncost;
                pq.push(P(ncost, pii(v, ntime)));
            }
        }
    }
    ll res = INF;
    rep (i, h + 1) chmin(res, dist[t][i]);
    return res;
}

void solve() {
    G.clear();
    G.resize(n);
    rep (i, m) {
        int u, v, cost, ti, com;
        cin >> u >> v >> cost >> ti >> com;
        u--; v--; com--;
        G[u].push_back(edge(v, cost, ti, com));
        G[v].push_back(edge(u, cost, ti, com));
    }

    int s, t;
    cin >> s >> t;
    s--; t--;
    int p;
    cin >> p;
    vector<pii> syu_cost(p);
    rep (i, p) {
        int nn, cost;
        cin >> nn >> cost;
        int syu = 0;
        rep (j, nn) {
            int u;
            cin >> u;
            u--;
            syu += 1 << u;
        }
        syu_cost[i] = pii(syu, cost);
    }

    vll dp(p + 1, vl(1 << k, INF));
    dp[0][0] = 0;
    rep (i, p) {
        rep (j, 1 << k) {
            if (dp[i][j] == INF) continue;
            chmin(dp[i + 1][j], dp[i][j]);
            int nj = j | syu_cost[i].first;
            chmin(dp[i + 1][nj], dp[i][j] + syu_cost[i].second);
        }
    }

    ll ans = INF;
    rep (i, 1 << k) {
        if (dp[p][i] == INF) continue;
        ll res = dp[p][i];
        res += dijkstra(s, t, i);
        chmin(ans, res);
    }
    if (ans == INF) cout << -1 << endl;
    else cout << ans << endl;
}

signed main() {
    while (true) {
        cin >> n >> m >> h >> k;
        if (n == 0) return 0;
        solve();
    }
}


Measured memory_bytes: 3684