#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void rset();
void init_test();
void solve();
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed;
  cout.precision(20);
  init_test();
  return 0;
}
template <typename T>
void chmin(T& a, T b) {
  if (a > b) a = b;
}
template <typename T>
void chmax(T& a, T b) {
  if (a < b) a = b;
}
template <typename T>
void MACRO_rdv2_Init(int n, T& t) {
  t.resize(n);
}
template <typename First, typename... Rest>
void MACRO_rdv2_Init(int n, First& first, Rest&... rest) {
  first.resize(n);
  MACRO_rdv2_Init(n, rest...);
}
template <typename T>
void MACRO_rdv2_Scan(int p, T& t) {
  std::cin >> t[p];
}
template <typename First, typename... Rest>
void MACRO_rdv2_Scan(int p, First& first, Rest&... rest) {
  std::cin >> first[p];
  MACRO_rdv2_Scan(p, rest...);
}
template <typename T>
void wrv(const vector<T>& v) {
  for (int(__ii) = (0); (__ii) < (((int)v.size())); ++(__ii)) {
    if (__ii) cout << ' ';
    cout << v[__ii];
  }
  cout << '\n';
}
template <typename T>
void wrm(const vector<vector<T>>& v) {
  for (int(__ii) = (0); (__ii) < (((int)v.size())); ++(__ii)) {
    for (int(__jj) = (0); (__jj) < (v[__ii].size()); ++(__jj)) {
      if (__jj) cout << ' ';
      cout << v[__ii][__jj];
    }
    cout << '\n';
  }
}
template <typename T>
void sc(T& x) {
  cin >> x;
}
template <typename Head, typename... Tail>
void sc(Head& head, Tail&... tail) {
  cin >> head;
  sc(tail...);
}
template <typename T>
void wr(const T& x) {
  cout << x << '\n';
}
template <typename Head, typename... Tail>
void wr(const Head& head, const Tail&... tail) {
  cout << head << ' ';
  wr(tail...);
}
template <typename T>
void wrf(const T& x) {
  cout << x << endl;
}
template <typename Head, typename... Tail>
void wrf(const Head& head, const Tail&... tail) {
  cout << head << ' ';
  wrf(tail...);
}
template <typename T>
void debug_out(const T& x) {
  cerr << x << '\n';
}
template <typename Head, typename... Tail>
void debug_out(const Head& head, const Tail&... tail) {
  cerr << head << ' ';
  debug_out(tail...);
}
template <typename... T>
void err(const T&... cod) {
  wr(cod...);
  exit(0);
}
long double dist(long double a, long double b, long double c, long double d) {
  a -= c;
  b -= d;
  return sqrt(a * a + b * b);
}
void solve() {
  long double ax, ay, bx, by, tx, ty;
  sc(ax, ay, bx, by, tx, ty);
  long double init = 0;
  int n;
  sc(n);
  vector<long double> x(n), y(n);
  for (int(i) = (0); (i) < (n); ++(i)) {
    cin >> x[i] >> y[i];
    init += 2 * dist(x[i], y[i], tx, ty);
  }
  long double ou = numeric_limits<double>::max();
  multiset<long double> ans;
  for (int(i) = (0); (i) < (n); ++(i)) {
    long double cur = init;
    cur -= dist(x[i], y[i], tx, ty);
    cur += dist(x[i], y[i], bx, by);
    ans.insert(cur);
    chmin(ou, cur);
    cur = init;
    cur -= dist(x[i], y[i], tx, ty);
    cur += dist(x[i], y[i], ax, ay);
    chmin(ou, cur);
  }
  for (int(i) = (0); (i) < (n); ++(i)) {
    long double cur = init;
    cur -= dist(x[i], y[i], tx, ty);
    cur += dist(x[i], y[i], bx, by);
    long double z = cur;
    ans.erase(ans.find(cur));
    cur = 0;
    cur += dist(x[i], y[i], tx, ty);
    cur += dist(x[i], y[i], ax, ay);
    chmin(ou, cur + *ans.begin() - 2 * dist(x[i], y[i], tx, ty));
    ans.insert(z);
  }
  wr(ou);
}
void init_test() {
  int qq = 1;
  while (qq--) solve();
}
