E

#include <bits/stdc++.h>

using namespace std;

#define fixed(n) fixed << setprecision(n)
#define ceil(n, m) (((n) + (m) - 1) / (m))
#define add_mod(a, b, m) (((a % m) + (b % m)) % m)
#define sub_mod(a, b, m) (((a % m) - (b % m) + m) % m)
#define mul_mod(a, b, m) (((a % m) * (b % m)) % m)
#define all(vec) vec.begin(), vec.end()
#define rall(vec) vec.rbegin(), vec.rend()
#define sz(x) int(x.size())
#define debug(x) cout << #x << ": " << (x) << "\n";
#define fi first
#define se second
#define ll long long
#define ull unsigned long long
#define EPS 1e-9
constexpr int INF = 1 << 30, Mod = 1e9 + 7;
constexpr ll LINF = 1LL << 62;
#define PI acos(-1)
template < typename T = int > using Pair = pair < T, T >;
vector < string > RET = {"NO", "YES"};

template < typename T = int > istream& operator >> (istream &in, vector < T > &v) {
    for (auto &x : v) in >> x;
    return in;
}

template < typename T = int > ostream& operator << (ostream &out, const vector < T > &v) {
    for (const T &x : v) out << x << ' ';
    return out;
}

template < typename T = int, int Base = 1 > struct DSU {

    vector < T > parent, Gsize;

    DSU(int MaxNodes){
        parent = Gsize = vector < T > (MaxNodes + 5);
        for(int i = Base; i <= MaxNodes; i++)
          parent[i] = i, Gsize[i] = 1;
    }

    T find_leader(int node){
        return parent[node] = (parent[node] == node ? node : find_leader(parent[node]));
    }

    bool is_same_sets(int u, int v){
        return find_leader(u) == find_leader(v);
    }

    void union_sets(int u, int v){
        int leader_u = find_leader(u), leader_v = find_leader(v);
        if(leader_u == leader_v) return;
        if(Gsize[leader_u] < Gsize[leader_v]) swap(leader_u, leader_v);
        Gsize[leader_u] += Gsize[leader_v], parent[leader_v] = leader_u;
    }

    int get_size(int u){
        return Gsize[find_leader(u)];
    }
};

struct Edge {

    ll u, v, g, s;

    Edge(ll U = 0, ll V = 0, ll G = 0, ll S = 0) : u(U), v(V), g(G), s(S) {}

    bool operator < (const Edge &other) const {
        return g < other.g;
    }
};

void Solve(){
    int n, m;
    cin >> n >> m;
    ll G, S;
    cin >> G >> S;
    vector < Edge > edges(m);
    for(auto& [u, v, g, s] : edges)
        cin >> u >> v >> g >> s;
    sort(all(edges));
    vector < Edge > MST;
    ll MinCost = LINF;
    for(int i = 0; i < m; i++){
        MST.push_back(edges[i]);
        sort(all(MST), [](Edge a, Edge b){
            return a.s < b.s;
        });
        DSU < ll > dsu(n);
        vector < Edge > temp;
        for(auto& [u, v, g, s] : MST){
            if(!dsu.is_same_sets(u, v)){
                dsu.union_sets(u, v);
                temp.push_back({u, v, g, s});
            }
        }
        MST = temp;
        if(sz(MST) == n - 1)
            MinCost = min(MinCost, edges[i].g * G + MST.back().s * S);
    }
    if(MinCost == LINF) cout << "LOSHA_FAILED\n";
    else cout << MinCost << "\n";
}

int main(){
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    int test_cases = 1;
    // cin >> test_cases;
    for(int tc = 1; tc <= test_cases; tc++){
        // cout << "Case #" << tc << ": ";
        Solve();
    }
    return 0;
}