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;
template <typename T>
inline void read(T &x) {
  x = 0;
  char c = getchar();
  bool flag = false;
  while (!isdigit(c)) {
    if (c == '-') flag = true;
    c = getchar();
  }
  while (isdigit(c)) {
    x = (x << 1) + (x << 3) + (c ^ 48);
    c = getchar();
  }
  if (flag) x = -x;
}
int n, tot, root, pos;
double ans, sum, val;
int w[400010], siz[400010], mx[400010];
double s[400010];
bool vis[400010];
struct edge {
  int to, nxt, v;
} e[400010];
int head[400010], edge_cnt;
void add(int from, int to, int val) {
  e[++edge_cnt] = {to, head[from], val}, head[from] = edge_cnt;
}
void dfs_root(int x, int fa) {
  siz[x] = 1, mx[x] = 0;
  for (int i = head[x]; i; i = e[i].nxt) {
    int y = e[i].to;
    if (vis[y] || y == fa) continue;
    dfs_root(y, x), siz[x] += siz[y];
    mx[x] = max(mx[x], siz[y]);
  }
  mx[x] = max(mx[x], tot - siz[x]);
  if (mx[x] < mx[root]) root = x;
}
void dfs_calc(int x, int fa, int dis, int rt) {
  val += sqrt(dis) * dis * w[x], s[rt] += sqrt(dis) * w[x];
  for (int i = head[x]; i; i = e[i].nxt) {
    int y = e[i].to;
    if (y == fa) continue;
    dfs_calc(y, x, dis + e[i].v, rt);
  }
}
void solve(int x) {
  vis[x] = true, val = sum = 0;
  for (int i = head[x]; i; i = e[i].nxt) {
    int y = e[i].to;
    s[y] = 0, dfs_calc(y, x, e[i].v, y), sum += s[y];
  }
  if (val < ans || !pos) ans = val, pos = x;
  for (int i = head[x]; i; i = e[i].nxt) {
    int y = e[i].to;
    if (vis[y]) continue;
    if (sum - 2 * s[y] <= 0) {
      root = 0, tot = siz[y], dfs_root(y, x), solve(root);
      break;
    }
  }
}
int main() {
  read(n);
  for (int i = 1; i <= n; ++i) read(w[i]);
  for (int i = 1; i < n; ++i) {
    int x, y, v;
    read(x), read(y), read(v);
    add(x, y, v), add(y, x, v);
  }
  tot = mx[0] = n, dfs_root(1, 0), solve(root);
  printf("%d %.10lf", pos, ans);
  return 0;
}
