3
1 1 5
1 3 42
1 2 42
 2
42 23
1 2 10
 10
45792697 27183921 4791060 77070594 27286110 66957065 19283638 2944837 26775511 65379701
5 8 25
8 10 94
1 4 14
9 7 96
4 2 16
2 6 58
2 3 99
6 8 21
8 9 87
 5
3 1 2 6 5
1 2 3
2 3 1
4 3 9
5 3 1
 10
26 31 21 57 56 44 54 58 79 97
2 1 277
1 8 91
1 7 380
4 1 649
10 5 799
10 1 940
8 6 627
6 3 177
9 6 685
 10
8 100 62 38 26 51 26 23 77 32
6 8 29
4 1 82
7 8 66
7 10 67
8 9 98
6 1 14
1 5 48
3 1 58
2 9 90
 2
23 42
1 2 10
 1
42
 3
1 5 1
1 3 42
1 2 42
 10
1 1 1 1 1 1 1 1 1 1
1 2 5
1 3 5
1 4 5
1 5 5
1 6 5
1 7 5
1 8 5
1 9 5
1 10 5
 3
1 1 1
1 2 42
2 3 42
 3
5 1 1
1 3 42
1 2 24

3 1042.0638260857 1 727.3238618387 6 283959805416.40496826
 3 192.0000000000 1 13952642.4776933547 8 544327.1927847408 2 727.3238618387 1 0.0000000000 2 1042.0638260857 1 100.6230589875 2 544.3822186663 1 389.7666169867
#include <bits/stdc++.h>
using namespace std;
inline void proc_status() {
  ifstream t("/proc/self/status");
  cerr << string(istreambuf_iterator<char>(t), istreambuf_iterator<char>())
       << endl;
}
namespace fastIO {
const unsigned int BUFFER_SIZE = (unsigned int)1 << 15;
char buffer[BUFFER_SIZE], *cur, *ed;
inline char getc() {
  return *(cur == ed    ? ed = buffer + fread(buffer, 1, BUFFER_SIZE, stdin),
           cur = buffer : cur)++;
}
}  // namespace fastIO
using fastIO::getc;
template <typename T>
inline T read() {
  register T sum(0), fg(1);
  register char ch(getc());
  for (; !isdigit(ch); ch = getc())
    if (ch == '-') fg = -1;
  for (; isdigit(ch); ch = getc()) sum = sum * 10 - '0' + ch;
  return sum * fg;
}
template <typename T>
inline T sqr(const T &val) {
  return val * val;
}
template <typename T>
inline int chkmin(T &a, const T &b) {
  return b < a ? a = b, 1 : 0;
}
template <typename T>
inline int chkmax(T &a, const T &b) {
  return b > a ? a = b, 1 : 0;
}
const int MAXN = (int)2e5;
int n;
int w[MAXN + 5];
struct rhs_vec {
  int v, w;
  rhs_vec() {}
  rhs_vec(int _v, int _w) : v(_v), w(_w) {}
};
vector<rhs_vec> adj[MAXN + 5];
inline void input() {
  n = read<int>();
  for (int i = 1; i <= n; ++i) w[i] = read<int>();
  for (int i = 1; i < n; ++i) {
    int u = read<int>(), v = read<int>(), l = read<int>();
    adj[u].emplace_back(v, l);
    adj[v].emplace_back(u, l);
  }
}
namespace DIV {
int cut[MAXN + 5], size[MAXN + 5];
inline void dfs_size(int u, int fa) {
  size[u] = 1;
  for (auto it : adj[u]) {
    int v = it.v;
    if (!cut[v] && v != fa) {
      dfs_size(v, u);
      size[u] += size[v];
    }
  }
}
inline int dfs_rt(int u, int fa, int tot) {
  int fg = 1;
  for (auto it : adj[u]) {
    int v = it.v;
    if (!cut[v] && v != fa) {
      int res = dfs_rt(v, u, tot);
      if (res) return res;
      if (size[v] * 2 > tot) fg = 0;
    }
  }
  if ((tot - size[u]) * 2 > tot) fg = 0;
  return fg ? u : 0;
}
inline double dfs_f(int u, int fa, int d) {
  double res = pow(d, 1.5) * w[u];
  for (auto it : adj[u]) {
    int v = it.v;
    if (v != fa) res += dfs_f(v, u, d + it.w);
  }
  return res;
}
inline double dfs_d(int u, int fa, int d) {
  double res = pow(d, 0.5) * 1.5 * w[u];
  for (auto it : adj[u]) {
    int v = it.v;
    if (v != fa) res += dfs_d(v, u, d + it.w);
  }
  return res;
}
double d[MAXN + 5];
inline void calc_d(int u) {
  for (auto it : adj[u]) {
    int v = it.v;
    d[u] += (d[v] = dfs_d(v, u, it.w));
  }
}
int nd = 0;
double ans = LLONG_MAX;
inline void solve(int u) {
  dfs_size(u, 0), u = dfs_rt(u, 0, size[u]);
  if (chkmin(ans, dfs_f(u, 0, 0))) nd = u;
  cut[u] = 1, calc_d(u);
  for (auto it : adj[u]) {
    int v = it.v;
    if (!cut[v] && d[u] - 2 * d[v] < 0) {
      solve(v);
      return;
    }
  }
}
}  // namespace DIV
inline void solve() {
  DIV::solve(1);
  printf("%d %.7lf\n", DIV::nd, DIV::ans);
}
int main() {
  input();
  solve();
  return 0;
}
