#include <bits/stdc++.h>
using namespace std;
inline bool isPowerOfTwo(int x) { return (x != 0 && (x & (x - 1)) == 0); }
double pi = 3.141592653589793238462643;
inline int add(int a, int b, int m = 1000000007) {
  a += b;
  if (a >= m) a -= m;
  return a;
}
inline int mul(int a, int b, int m = 1000000007) {
  return (int)(((long long)a * (long long)b) % m);
}
inline bool ispalin(string &str) {
  int n = str.length();
  for (int i = 0; i < n / 2; i++)
    if (str[i] != str[n - i - 1]) return false;
  return true;
}
long long expo(long long base, long long pow) {
  long long ans = 1;
  while (pow != 0) {
    if (pow & 1 == 1) {
      ans = ans * base;
      ans = ans % 1000000007;
    }
    base *= base;
    base %= 1000000007;
    pow /= 2;
  }
  return ans;
}
void swapp(int *a, int *b) {
  int temp = *a;
  *a = *b;
  *b = temp;
}
long long inv(long long x) { return expo(x, 1000000007 - 2); }
int expFactor(int n, int p) {
  int x = p;
  int exponent = 0;
  while ((n / x) > 0) {
    exponent += n / x;
    x *= p;
  }
  return exponent;
}
inline int countsetbit(int n) {
  unsigned int count = 0;
  while (n) {
    n &= (n - 1);
    count++;
  }
  return count;
}
inline int abs(int x) {
  if (x < 0) return -x;
  return x;
}
bool isPal(string ss) {
  int len = ss.length();
  for (int i = 0; i < len / 2; i++) {
    int comp = len - i - 1;
    if (ss[i] != ss[comp]) return false;
  }
  return true;
}
long long _sieve_size;
bitset<10000010> bs;
vector<int> primes;
void sieve(long long upperbound) {
  _sieve_size = upperbound + 1;
  bs.set();
  bs[0] = bs[1] = 0;
  for (long long i = 2; i <= _sieve_size; i++)
    if (bs[i]) {
      for (long long j = i * i; j <= _sieve_size; j += i) bs[j] = 0;
      primes.push_back((int)i);
    }
}
bool isPrime(long long N) {
  if (N <= _sieve_size) return bs[N];
  for (int i = 0; i < (int)primes.size(); i++)
    if (N % primes[i] == 0) return false;
  return true;
}
int main() {
  int s, x1, x2;
  cin >> s >> x1 >> x2;
  int t1, t2;
  cin >> t1 >> t2;
  int p, d;
  cin >> p >> d;
  if (t2 <= t1) {
    cout << abs(x2 - x1) * t2 << endl;
  } else {
    int pr = abs(x2 - x1) * t2, pb;
    int d2 = 1;
    if (x1 > x2) d2 = -1;
    if (d == 1 && d2 == 1) {
      if (p > x1) {
        cout << min((s - p + s + x2) * t1, pr) << endl;
      } else {
        cout << min((x2 - p) * t1, pr) << endl;
      }
    } else if (d == 1 && d2 == -1) {
      cout << min((s - p + s - x2) * t1, pr) << endl;
    } else if (d == -1 && d2 == 1) {
      cout << min((p + x2) * t1, pr) << endl;
    } else {
      if (p < x1) {
        cout << min((p + s + s - x2) * t1, pr) << endl;
      } else {
        cout << min((p - x2) * t1, pr) << endl;
      }
    }
  }
}
