#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#define ll long long
using namespace std;
const int MM=5005,MN=1e5+5;
ll a[MM],b[MM],la,lb,dp[MM][MM],x,y,z,n,c[2],ans;
bool op;
priority_queue<ll> q[2];
void write(ll n){if(n<0){putchar('-');write(-n);return;}if(n>9)write(n/10);putchar(n%10+'0');}
ll read(){ll x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}return x*f;}
int main(){
    n=read();x=read();y=read();z=read();
    if(n<=5000){
        for(int i=1; i<=n; i++){
            ll num;
            num=read();while(num){a[++la]=i;num--;}
            num=read();while(num){b[++lb]=i;num--;}
        }
        for(int i=0; i<=lb; i++) dp[0][i]=i*x;
        for(int i=0; i<=la; i++) dp[i][0]=i*y;
        for(int i=1; i<=la; i++) for(int j=1; j<=lb; j++){
            dp[i][j]=i*y+j*x;
            dp[i][j]=min(dp[i][j],dp[i][j-1]+x);
            dp[i][j]=min(dp[i][j],dp[i-1][j]+y);
            dp[i][j]=min(dp[i][j],dp[i-1][j-1]+z*abs(a[i]-b[j]));
        }
        write(dp[la][lb]);putchar('\n');
        return 0;
    }
    c[0]=y;c[1]=x;
    for(int i=1; i<=n; i++){
        ll u=read(),v=read();
        if(u==v) continue;
        op=u>v;
        for(int j=1; j<=abs(u-v); j++){
            if(q[op^1].empty()||i*z-q[op^1].top()>c[op^1]){
                ans+=c[op^1];
                q[op].push(i*z+c[op^1]);
            }
            else{
                ans+=i*z-q[op^1].top();
                q[op].push(2*i*z-q[op^1].top()),q[op^1].pop();
            }
        }
    }
    write(ans);putchar('\n');
    return 0;
}