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>
#pragma GCC optimize(2, 3, "Ofast", "unroll-loops")
using namespace std;
namespace fast_io {
char buf[1 << 12], *p1 = buf, *p2 = buf, sr[1 << 23], z[23], nc;
int C = -1, Z = 0, Bi = 0, ny;
inline char gc() {
  return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 12, stdin), p1 == p2)
             ? EOF
             : *p1++;
}
inline long long read() {
  long long x = 0;
  ny = 1;
  while (nc = gc(), (nc < 48 || nc > 57) && nc != EOF)
    if (nc == 45) ny = -1;
  Bi = 1;
  if (nc < 0) return nc;
  x = nc - 48;
  while (nc = gc(), 47 < nc && nc < 58 && nc != EOF)
    x = (x << 3) + (x << 1) + (nc ^ 48), Bi++;
  return x * ny;
}
inline double gf() {
  int a = read(), y = ny, b = (nc != '.') ? 0 : read();
  return (b ? a + (double)b / pow(10, Bi) * y : a);
}
inline int gs(char *s) {
  char c, *t = s;
  while (c = gc(), c <= 32)
    ;
  *s++ = c;
  while (c = gc(), c > 32) *s++ = c;
  return s - t;
}
inline void ot() {
  fwrite(sr, 1, C + 1, stdout);
  C = -1;
}
inline void flush() {
  if (C > 1 << 22) ot();
}
template <typename T>
inline void write(T x, char t) {
  int y = 0;
  if (x < 0) y = 1, x = -x;
  while (z[++Z] = x % 10 + 48, x /= 10)
    ;
  if (y) z[++Z] = '-';
  while (sr[++C] = z[Z], --Z)
    ;
  sr[++C] = t;
  flush();
}
inline void write(char *s) {
  int l = strlen(s);
  for (int i = 0; i < l; i++) sr[++C] = *s++;
  sr[++C] = '\n';
  flush();
}
}  // namespace fast_io
using namespace fast_io;
const int N = 2e5 + 5;
int n, rt, w[N], siz[N], vis[N], ans1;
double sum, sd, d[N], ans2 = 1e100;
vector<pair<int, int> > e[N];
inline void add(int u, int v, int w) {
  e[u].emplace_back(v, w);
  e[v].emplace_back(u, w);
}
void dfs(int u, int fa, int t) {
  siz[u] = 1;
  int mx = 0;
  for (auto [v, w] : e[u])
    if (!vis[v] && v ^ fa) dfs(v, u, t), siz[u] += siz[v], mx = max(mx, siz[v]);
  mx = max(mx, t - siz[u]);
  if (mx <= (t >> 1)) rt = u;
}
void calc(int u, int fa, int p, int x) {
  sum += pow(x, 1.5) * w[u];
  d[p] += pow(x, 0.5) * 1.5 * w[u];
  for (auto [v, w] : e[u])
    if (v ^ fa) calc(v, u, p, x + w);
}
void solve(int u, int t) {
  dfs(u, 0, t), u = rt, dfs(u, 0, t);
  if (vis[u]) return;
  vis[u] = 1;
  sum = sd = 0;
  for (auto [v, w] : e[u]) d[v] = 0, calc(v, u, v, w), sd += d[v];
  if (sum < ans2) ans1 = u, ans2 = sum;
  for (auto [v, w] : e[u])
    if (sd - d[v] * 2 < 0) {
      solve(v, siz[v]);
      break;
    }
}
int main() {
  n = read();
  for (int i = 1; i <= n; i++) w[i] = read();
  for (int i = 1, u, v; i < n; i++) u = read(), v = read(), add(u, v, read());
  solve(1, n);
  printf("%d %.10lf\n", ans1, ans2);
  return ot(), 0;
}
