#include <bits/stdc++.h>
using namespace std;
const long double pi = 3.14159265358979;
const long long int mod = 1e9 + 7;
long long int takemod(long long int a, long long int mod) {
  return ((a % mod) + mod) % mod;
}
long long int power(long long int b, long long int p) {
  if (p == 0)
    return 1;
  else if (p % 2 == 0) {
    long long int q = power(b, p / 2);
    return ((q) * (q));
  } else
    return ((b) * (power(b, p - 1)));
}
long long int powerm(long long int b, long long int p) {
  if (p == 0)
    return 1;
  else if (p % 2 == 0) {
    long long int q = powerm(b, p / 2);
    return ((q % mod) * (q % mod)) % mod;
  } else
    return ((b % mod) * (powerm(b, p - 1) % mod)) % mod;
}
bool isprime(long long int n) {
  if (n == 1) return false;
  if (n == 2 or n == 3) return true;
  long long int lim = sqrt(n);
  long long int i = 2;
  while (i <= lim) {
    if (n % i == 0) return false;
    i++;
  }
  return true;
}
vector<long long int> factors(long long int n) {
  vector<long long int> a;
  long long int lim = sqrt(n), i = 2;
  while (i <= lim) {
    if (n % i == 0) {
      a.push_back(i);
      if (i != n / i) a.push_back(n / i);
    }
    i++;
  }
  sort(a.begin(), a.end());
  return a;
}
vector<pair<long long int, long long int> > pf_with_count(long long int b) {
  pair<long long int, long long int> p;
  vector<pair<long long int, long long int> > pf;
  long long int count = 0;
  while (b % 2 == 0) {
    b /= 2;
    count++;
  }
  if (count > 0) {
    p.first = 2;
    p.second = count;
    pf.push_back(p);
  }
  long long int i = 3;
  while (i <= sqrt(b)) {
    count = 0;
    while (b % i == 0) {
      b /= i;
      count++;
    }
    if (count > 0) {
      p.first = i;
      p.second = count;
      pf.push_back(p);
    }
    i += 2;
  }
  if (b > 2) {
    p.first = b;
    p.second = 1;
    pf.push_back(p);
  }
  sort(pf.begin(), pf.end());
  return pf;
}
long long int bs_t_i(string second) {
  long long int l = strtoull(second.c_str(), NULL, 2);
  return l;
}
string i_to_bs(long long int n) {
  string second = bitset<4>(n).to_string();
  return second;
}
void solve() {
  long long int a, b, c, d, e, first;
  cin >> a >> b >> c >> d >> e >> first;
  if (e >= first) {
    long long int cost = min(a, d) * e;
    d -= min(a, d);
    cout << cost + min(d, min(c, b)) * first;
  } else {
    long long int cost = min(d, min(c, b)) * first;
    d -= min(d, min(c, b));
    cout << cost + min(d, a) * e;
  }
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long int t = 1;
  while (t--) solve();
}
