#include <bits/stdc++.h>
using namespace std;

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define FOR(i, a, b) for (int i = (a); i<(b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i>=(a); --i)
#define MP make_pair
#define PB push_back
#define F first
#define S second

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

typedef double db;

#define y1 zhepa

const int N = 1 << 10;

db dist(db x1, db y1, db x2, db y2) {
	return sqrt((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1));
}

db vWalk, vBike, x1, y1, x2, y2, xg, yg, xd, yd;
db xs[N], ys[N], dg[N], dd[N];

db f(db xb, db yb, db xe, db ye, db xs1, db ys1, db xs2, db ys2) {
	db l = 0, r = 1;
	db ans;
	FOR(i, 0, 400) {
		db m1 = l + (r - l) / 3, m2 = r - (r - l) / 3;
		db xm1 = (1 - m1) * xs1 + m1 * xs2, ym1 = (1 - m1) * ys1 + m1 * ys2,
			xm2 = (1 - m2) * xs1 + m2 * xs2, ym2 = (1 - m2) * ys1 + m2 * ys2;
		db f1 = dist(xb, yb, xm1, ym1) / vWalk + dist(xm1, ym1, xe, ye) / vBike,
			f2 = dist(xb, yb, xm2, ym2) / vWalk + dist(xm2, ym2, xe, ye) / vBike;
		if (f1 < f2) {
			r = m2;
		}
		else {
			l = m1;
		}
		ans = f1;
	}
	return ans;
}

db f(db xb, db yb, db xe, db ye) {
	db ans = 1e47;
	ans = min(ans, f(xb, yb, xe, ye, x1, y1, x2, y1));
	ans = min(ans, f(xb, yb, xe, ye, x2, y1, x2, y2));
	ans = min(ans, f(xb, yb, xe, ye, x2, y2, x1, y2));
	ans = min(ans, f(xb, yb, xe, ye, x1, y2, x1, y1));
	return ans;
}

db g(db xs1, db ys1, db xs2, db ys2) {
	db l = 0, r = 1;
	db ans;
	FOR(i, 0, 400) {
		db m1 = l + (r - l) / 3, m2 = r - (r - l) / 3;
		db xm1 = (1 - m1) * xs1 + m1 * xs2, ym1 = (1 - m1) * ys1 + m1 * ys2,
			xm2 = (1 - m2) * xs1 + m2 * xs2, ym2 = (1 - m2) * ys1 + m2 * ys2;
		db f1 = dist(xg, yg, xm1, ym1) / vWalk + f(xd, yd, xm1, ym1),
			f2 = dist(xg, yg, xm2, ym2) / vWalk + f(xd, yd, xm2, ym2);
		if (f1 < f2) {
			r = m2;
		}
		else {
			l = m1;
		}
		ans = f1;
	}
	return ans;
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(10);
	cin >> vWalk >> vBike >> x1 >> y1 >> x2 >> y2 >> xg >> yg >> xd >> yd;
	int n;
	cin >> n;
	FOR(i, 0, n) {
		cin >> xs[i] >> ys[i];
		dg[i] = dist(xs[i], ys[i], xg, yg) / vWalk;
		dd[i] = dist(xs[i], ys[i], xd, yd) / vWalk;
	}
	db ans = dist(xg, yg, xd, yd) / vWalk;
	FOR(i, 0, n) {
		FOR(j, 0, n) {
			ans = min(ans, (dg[i] + dd[j]) + dist(xs[i], ys[i], xs[j], ys[j]) / vBike);
		}
		ans = min(ans, dg[i] + f(xd, yd, xs[i], ys[i]));
		ans = min(ans, dd[i] + f(xg, yg, xs[i], ys[i]));
	}
	ans = min(ans, g(x1, y1, x2, y1));
	ans = min(ans, g(x2, y1, x2, y2));
	ans = min(ans, g(x2, y2, x1, y2));
	ans = min(ans, g(x1, y2, x1, y1));
	cout << ans << "\n";
	return 0;
}