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>
const int N = 2e5 + 6;
int n, w[N], head[N], cnt, anf, rt, mxd[N], sz[N], all;
bool vis[N];
double ans = 1e19, ds, D[N], res;
struct edge {
  int to, nxt, dis;
} e[N << 1];
void getrt(int now, int pre) {
  sz[now] = 1, mxd[now] = 0;
  for (int i = head[now]; i; i = e[i].nxt)
    if (!vis[e[i].to] && pre != e[i].to) {
      getrt(e[i].to, now);
      if (mxd[now] < sz[e[i].to]) mxd[now] = sz[e[i].to];
      sz[now] += sz[e[i].to];
    }
  if (mxd[now] < all - sz[now]) mxd[now] = all - sz[now];
  if (!rt || mxd[rt] > mxd[now]) rt = now;
}
void dfs(int now, int pre, double& D, int dist) {
  const double sq = sqrt(dist);
  res += sq * dist * w[now], D += sq * w[now], ds += sq * w[now];
  for (int i = head[now]; i; i = e[i].nxt)
    if (e[i].to != pre) dfs(e[i].to, now, D, dist + e[i].dis);
}
void solve(int now) {
  vis[now] = 1;
  ds = res = 0;
  for (int i = head[now]; i; i = e[i].nxt) {
    D[e[i].to] = 0;
    dfs(e[i].to, now, D[e[i].to], e[i].dis);
  }
  if (ans > res) ans = res, anf = now;
  for (int i = head[now]; i; i = e[i].nxt)
    if (ds - 2 * D[e[i].to] < 0) {
      if (vis[e[i].to]) break;
      all = sz[e[i].to] < sz[now] ? sz[e[i].to] : all - sz[now];
      rt = 0;
      getrt(e[i].to, now);
      solve(rt);
      break;
    }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%d", w + i);
  for (int i = 1; i < n; ++i) {
    int u, v, w;
    scanf("%d%d%d", &u, &v, &w);
    e[++cnt] = (edge){v, head[u], w}, head[u] = cnt;
    e[++cnt] = (edge){u, head[v], w}, head[v] = cnt;
  }
  all = n;
  rt = 0;
  getrt(1, 0);
  solve(rt);
  printf("%d %.10e\n", anf, ans);
  return 0;
}
