#include <bits/stdc++.h>

#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)
#define RFOR(i,a) for(int i=(a); i >= 0; --i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x)  cerr << #x << " = " << (x) << endl;
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())
#define BIT_ON(bit, i) (bit & (1LL << i))

typedef long long LL;
template<typename T> using V = std::vector<T>;
template<typename T> using VV = std::vector<std::vector<T>>;
template<typename T> using VVV = std::vector<std::vector<std::vector<T>>>;
template<typename T> using VVVV = std::vector<std::vector<std::vector<std::vector<T>>>>;

template<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
template<class T> inline void print(T x) { std::cout << x << std::endl; }
template<class T> inline void print_vec(const std::vector<T> &v) { for (int i = 0; i < v.size(); ++i) {  if (i != 0) {std::cout << " ";} std::cout << v[i];} std::cout << "\n"; }
template<class T> inline bool inside(T y, T x, T H, T W) {return 0 <= y and y < H and 0 <= x and x < W; }
template<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }
template<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }
template<class T> inline std::vector<T> unique(std::vector<T> v) {
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    return v;
}
// 初項s, 交差dのn個の数列の和
long long sum_of_arithmetic_progression(long long s, long long d, long long n) {
    return n * (2 * s + (n - 1) * d) / 2;
}

const int INF = 1 << 30;
const double EPS = 1e-9;
const std::string YES = "YES", Yes = "Yes", NO = "NO", No = "No";
const std::vector<int> dy4 = { 0, 1, 0, -1 }, dx4 = { 1, 0, -1, 0 };    // 4近傍（右, 下, 左, 上）
const std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };

using namespace std;

int solve(int S, int T, int N, int H, const VV<tuple<int, int, int, int>> &route, int free_bit) {
    VV<int> dp(N + 1, V<int>(25, INF));
    dp[S][0] = 0;

    priority_queue<tuple<int, int, int>> que; // (料金、時間、駅)
    que.emplace(make_tuple(0, 0, S));

    while (not que.empty()) {
        int now_price, now_hour, now_station;
        tie(now_price, now_hour, now_station) = que.top();
        now_price *= -1; now_hour *= -1;
        que.pop();

        if (now_station == T) {
            return now_price;
        }

        FOE(&t, route[now_station]) {
            int next_station, p, h, r;
            tie(next_station, p, h, r) = t;

            if (BIT_ON(free_bit, r)) {
                p = 0;
            }

            if (now_hour + h <= H) {
                if (dp[next_station][now_hour + h] > now_price + p) {
                    que.emplace(make_tuple(-(now_price + p), -(now_hour + h), next_station));
                    dp[next_station][now_hour + h] = now_price + p;
                }
            }
        }
    }

    return INF;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    while (true ) {
        int N, M, H, K;
        cin >> N >> M >> H >> K;
        if (N + M + H + K == 0) {
            break;
        }

        VV<tuple<int, int, int, int>> route(N + 1);
        FOR(i, 0, M) {
            int a, b, c, h, r;
            cin >> a >> b >> c >> h >> r;
            a--; b--; r--;
            route[a].emplace_back(make_tuple(b, c, h, r));
            route[b].emplace_back(make_tuple(a, c, h, r));
        }
        int S, T, P;
        cin >> S >> T;
        S--; T--;
        cin >> P;

        V<pair<int, int>> passport;
        FOR(i, 0, P) {
            int l, d;
            cin >> l >> d;
            int b = 0;
            FOR(j, 0, l) {
                int k;
                cin >> k;
                k--;
                b |= (1 << k);
            }
            passport.emplace_back(make_pair(b, d));
        }

        V<int> price(1 << K, INF);
        price[0] = 0;
        for (int b = 0; b < (1 << K); ++b) {
            FOE(&p, passport) {
                price[b | p.first] = min(price[b | p.first], price[b] + p.second);
            }
        }

        int ans = INF;
        FOR(b, 0, 1 << K) {
            if (price[b] == INF) {
                continue;
            }
            ans = min(ans, solve(S, T, N, H, route, b) + price[b]);
            if (ans == INF) {
                break;
            }
        }
        if (ans == INF) {
            print(-1);
        }
        else {
            print(ans);
        }

    }
    return 0;
}


Measured memory_bytes: 3256