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 int read() {
  register int x = 0, f = 1;
  register char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') x = x * 10 + (ch ^ 48), ch = getchar();
  return x * f;
}
const int N = 4e5 + 5;
int n, nu, rt, now, res, _max, a[N], v[N], w[N], vi[N], si[N], nex[N], head[N];
void addedges(int x, int y, int z) {
  nex[++now] = head[x], w[now] = z;
  head[x] = now, v[now] = y;
}
double ans, sum, tot, d[N];
void get(int x, int fa) {
  si[x] = 1;
  for (int i = head[x]; i; i = nex[i])
    if (v[i] != fa && !vi[v[i]]) get(v[i], x), si[x] += si[v[i]];
  if (_max > max(si[x], nu - si[x])) _max = max(si[x], nu - si[x]), rt = x;
}
void calc(int x, int fa, int dis) {
  sum += pow(dis, 1.5) * a[x];
  d[x] = 1.5 * pow(dis, 0.5) * a[x];
  for (int i = head[x]; i; i = nex[i])
    if (v[i] != fa) {
      calc(v[i], x, dis + w[i]);
      d[x] += d[v[i]];
    }
}
void dfs(int x) {
  sum = 0, nu = si[x], _max = nu + 1, get(x, x), vi[rt] = 1;
  for (int i = head[rt]; i; i = nex[i]) calc(v[i], rt, w[i]), tot += d[v[i]];
  if (ans > sum) ans = sum, res = rt;
  for (int i = head[rt]; i; i = nex[i])
    if (tot - d[v[i]] * 2 < 0 && !vi[v[i]]) dfs(v[i]);
}
int main() {
  n = read(), ans = LLONG_MAX;
  for (int i = 1; i <= n; i++) a[i] = read();
  for (int i = 1; i < n; i++) {
    int x = read(), y = read(), z = read();
    addedges(x, y, z), addedges(y, x, z);
  }
  si[1] = n, dfs(1);
  printf("%d %.6lf\n", res, ans);
  return 0;
}
