#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define db double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define F(i,l,r) for(int i = (l);i <= (r);++i)
#define D(i,r,l) for(int i = (r);i >= (l);--i)
#define vt vector
#define mem(a,x) memset(a,x,sizeof a)
#define fi first
#define in inline
#define se second
#define pb push_back
#define bug cerr<<"LINE:"<<__LINE__<<" "
mt19937 rd(std::chrono::steady_clock::now().time_since_epoch().count());
constexpr int N = 2e5+10;
constexpr ll inf = 1e18,mod = 998244353;


ll read(){
	ll x = 0,f = 1;char c = getchar();
	for(;c < '0' || c > '9';c = getchar())if(c == '-')f = -1;
	for(;c >= '0' && c <= '9';c = getchar())x = (x<<1) + (x<<3) + c-'0';
	return x * f;
}

void cmax(ll &x,ll y){x = max(x,y);}
void cmin(ll &x,ll y){x = min(x,y);}


int n,m;
ll l,r,a[N],b[N];

struct line{
	int x,y;ll z;
	bool operator < (const line a)const{return z < a.z;};
}c[N],e[N];
struct DSU{
	int fa[N];
	void build(){F(i,1,n)fa[i] = i;}
	int find(int x){return x == fa[x] ? x : fa[x] = find(fa[x]);}
	void merge(int x,int y){
		x = find(x),y = find(y);
		if(x == y)return;
		fa[x] = y;
	}
}U;

ll ans = inf;
void kruskal(){
	ll sum = 0;
	U.build();
	sort(e + 1,e + 1 + m);
	F(i,1,m){
		int x = e[i].x,y = e[i].y;ll z = e[i].z;
		x = U.find(x),y = U.find(y);
		if(x == y)continue;
		U.merge(x,y),sum += z;
	}
//	cout<<sum<<endl;
//	puts("");
	cmin(ans,sum);
}
void solve(){
	while(cin>>n){
		m = read(),l = read(),r = read();
		ans = inf;
		F(i,1,m){
			c[i].x = read(),c[i].y = read();
			a[i] = read(),b[i] = read();
			c[i].z = a[i] + b[i] * l;
		}
		F(i,1,m)e[i] = c[i];
		kruskal();
		F(i,1,m)e[i] = {c[i].x,c[i].y,a[i] + b[i] * r};
		kruskal();
		printf("%lld\n",ans);
	}
}

int main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	int t = 1;
	while(t--)solve();
	return 0;
}