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;
int read() {
  int s = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') s = s * 10 + ch - '0', ch = getchar();
  return s * f;
}
struct edge {
  int to, lt, v;
} e[200010 << 1];
int in[200010], cnt;
void add(int x, int y, int v) {
  e[++cnt].to = y;
  e[cnt].lt = in[x];
  in[x] = cnt;
  e[cnt].v = v;
  e[++cnt].to = x;
  e[cnt].lt = in[y];
  in[y] = cnt;
  e[cnt].v = v;
}
int sz[200010], mx[200010], dep[200010], tot, a[200010], rt, w;
double f[200010], sum, ans, fin;
bool vis[200010];
void dfs(int x, int fr) {
  sz[x] = 1;
  mx[x] = 0;
  for (int i = in[x]; i; i = e[i].lt) {
    int y = e[i].to;
    if (y == fr || vis[y]) continue;
    dfs(y, x);
    sz[x] += sz[y];
    mx[x] = max(mx[x], sz[y]);
  }
  mx[x] = max(mx[x], tot - sz[x]);
  if (mx[x] < mx[rt]) rt = x;
}
void dfs(int x, int fr, int rt, int d) {
  ans += sqrt(d) * a[x] * d;
  f[rt] += 1.5 * a[x] * sqrt(d);
  sz[x] = 1;
  for (int i = in[x]; i; i = e[i].lt) {
    int y = e[i].to;
    if (y == fr) continue;
    dfs(y, x, rt, d + e[i].v);
    sz[x] += sz[y];
  }
}
void solve(int x) {
  ans = sum = 0;
  vis[x] = 1;
  for (int i = in[x]; i; i = e[i].lt) {
    int y = e[i].to;
    f[0] = 0;
    dfs(y, x, y, e[i].v);
    sum += f[y];
  }
  if (ans < fin) fin = ans, w = x;
  for (int i = in[x]; i; i = e[i].lt) {
    int y = e[i].to;
    if (vis[y]) continue;
    if (sum - 2 * f[y] < 0) {
      int tot = sz[y];
      rt = 0;
      dfs(y, x);
      solve(rt);
    }
  }
}
int main() {
  mx[0] = 20021225;
  int n = read();
  fin = 1e20;
  for (int i = 1; i <= n; i++) a[i] = read();
  for (int i = 1; i < n; i++) {
    int x = read(), y = read(), v = read();
    add(x, y, v);
  }
  tot = n;
  dfs(1, 0);
  solve(rt);
  printf("%d %.10lf\n", w, fin);
  return 0;
}
