#include<iostream>

#include<cstdlib>

#include<cstdio>

#include<cstring>

#include<algorithm>

#include<cmath>

using namespace std;

struct node{

    double x,y;

}A[];

node v1,v2;

double P,Q,R;

double dis(double x1,double y1,double x2,double y2){

    return sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));

}

double get_dis(double l1,double l2){

    double x1,x2,y1,y2;

    x1=A[].x+v1.x*l1;y1=A[].y+v1.y*l1;

    x2=A[].x+v2.x*l2;y2=A[].y+v2.y*l2;

    return dis(A[].x,A[].y,x1,y1)/P+dis(x1,y1,x2,y2)/R+dis(x2,y2,A[].x,A[].y)/Q;

}

double get(double l1){

    double L=,R=,mid1,mid2;

    for(int i=;i<=;++i){

        mid1=(L+R)/,mid2=(mid1+R)/;

        double k1=get_dis(l1,mid1);

        double k2=get_dis(l1,mid2);

        if(k1<k2)R=mid2;else L=mid1;

    }

    return get_dis(l1,L);

}

void work(){

    for(int i=;i<;++i)scanf("%lf%lf",&A[i].x,&A[i].y);

    scanf("%lf%lf%lf",&P,&Q,&R);

    v1.x=A[].x-A[].x,v1.y=A[].y-A[].y;

    v2.x=A[].x-A[].x,v2.y=A[].y-A[].y;

    double L=,R=,mid1,mid2;

    for(int i=;i<=;++i){

        mid1=(L+R)/,mid2=(mid1+R)/;

        double k1=get(mid1);

        double k2=get(mid2);

        if(k1<k2)R=mid2;else L=mid1;

    }

    printf("%.2lf\n",get(L));

}

int main(){

    work();

    return ;

}