#include <algorithm>

#include  <iterator>

#include  <iostream>

#include   <cstring>

#include   <cstdlib>

#include   <iomanip>

#include    <bitset>

#include    <cctype>

#include    <cstdio>

#include    <string>

#include    <vector>

#include     <stack>

#include     <cmath>

#include     <queue>

#include      <list>

#include       <map>

#include       <set>

#include   <cassert>

using namespace std;

//#pragma GCC optimize(3)

//#pragma comment(linker, "/STACK:102400000,102400000")  //c++

#define lson (l , mid , rt << 1)

#define rson (mid + 1 , r , rt << 1 | 1)

#define debug(x) cerr << #x << " = " << x << "\n";

#define pb push_back

#define pq priority_queue

typedef long long ll;

typedef unsigned long long ull;

typedef pair<ll ,ll > pll;

typedef pair<int ,int > pii;

typedef pair<int,pii> p3;

//priority_queue<int> q;//这是一个大根堆q

//priority_queue<int,vector<int>,greater<int> >q;//这是一个小根堆q

#define fi first

#define se second

//#define endl '\n'

#define OKC ios::sync_with_stdio(false);cin.tie(0)

#define FT(A,B,C) for(int A=B;A <= C;++A)  //用来压行

#define REP(i , j , k)  for(int i = j ; i <  k ; ++i)

//priority_queue<int ,vector<int>, greater<int> >que;

const ll mos = 0x7FFFFFFF;  //

const ll nmos = 0x80000000;  //-2147483648

const int inf = 0x3f3f3f3f;

const ll inff = 0x3f3f3f3f3f3f3f3f; //

const int mod = ;

const double esp = 1e-;

const double PI=acos(-1.0);

template<typename T>

inline T read(T&x){

    x=;int f=;char ch=getchar();

    while (ch<''||ch>'') f|=(ch=='-'),ch=getchar();

    while (ch>=''&&ch<='') x=x*+ch-'',ch=getchar();

    return x=f?-x:x;

}

/*-----------------------showtime----------------------*/

            const int maxm = 1e6+;

            const int maxn = 1e3+;

            struct edge

            {

                int from,to,c;

            }e[maxm];

            int X,Y,Z,n,tot;

            struct node

            {

                int x,y,z;

            }p[maxn];

            int in[maxn],vis[maxn],pre[maxn],id[maxn];

            int rtt;

                int zhuliu(int root,int n,int m){

                    int res = ;

                    while(true){

                        memset(in, inf, sizeof(in));

                        for(int i=; i<=m ;i++){

                            if(e[i].from != e[i].to && e[i].c < in[e[i].to]){

                                pre[e[i].to] = e[i].from;

                                in[e[i].to] = e[i].c;

                            }

                        }

                        for(int i=; i<=n; i++){

                            if(i!=root && in[i] == inf)

                                return -;

                        }

                        int tn = ,v;

                        memset(id,-,sizeof(id));

                        memset(vis,-,sizeof(vis));

                        in[root] = ;

                        for(int i=; i<=n; i++){

                            res += in[i];

                            v = i;

                            while(v!=root && id[v] == - && vis[v] != i){

                                vis[v] = i;

                                v = pre[v];

                            }

                            if(v!=root && id[v] == -){

                                id[v] = ++tn;

                                for(int u = pre[v] ; u!=v; u = pre[u]){

                                    id[u] = tn;

                                }

                            }

                        }

                        if(tn == )break;

                        for(int i=; i<=n; i++){

                            if(id[i] == -)id[i] = ++tn;

                        }

                        for(int i=; i<=m; i++){

                            int v = e[i].to;

                            e[i].to = id[e[i].to];

                            e[i].from = id[e[i].from];

                            if(e[i].to != e[i].from){

                                e[i].c -= in[v];

                            }

                        }

                        n = tn;root = id[root];

                    }

                    return res;

                }

                int get(int u,int v){

                    int ans = abs(p[u].x - p[v].x) +abs(p[u].y - p[v].y)+abs(p[u].z - p[v].z);

                    ans = ans * Y;

                    if(p[v].z > p[u].z)ans += Z;

                    return ans;

                }

int main(){

                while(~scanf("%d%d%d%d", &n, &X,&Y,&Z) && n+X+Y+Z){

                    tot = ;

                    for(int i=; i<=n; i++){

                        scanf("%d%d%d", &p[i].x, &p[i].y, &p[i].z);

                    }

                    for(int i=; i<=n; i++){

                        int x,k;scanf("%d", &k);

                        for(int j=; j<=k; j++)

                        {

                            scanf("%d", &x);

                            e[++tot].from = i;

                            e[tot].to = x;

                            e[tot].c = get(i,x);

                        }

                    }

                    for(int i=; i<=n; i++){

                        e[++tot].from = ;

                        e[tot].to = i;

                        e[tot].c = X * p[i].z;

                    }   

                    int ans = zhuliu(,n,tot);

                    printf("%d\n", ans);

                }

                return ;

}