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;
const double eps = 1e-8;
const int N = 200005;
int n, Size, ans, num, a[N], siz[N], h[N], e[N << 1], pre[N << 1], w[N << 1];
bool vis[N];
double Ans, f[N];
void add(int x, int y, int z) {
  e[++num] = y, w[num] = z, pre[num] = h[x], h[x] = num;
}
pair<int, int> dfs(int u, int fa = 0) {
  pair<int, int> ans = make_pair(n, 0);
  int mx = 0;
  siz[u] = 1;
  for (int i = h[u]; i; i = pre[i])
    if (e[i] != fa && !vis[e[i]])
      ans = min(ans, dfs(e[i], u)), siz[u] += siz[e[i]],
      mx = max(mx, siz[e[i]]);
  mx = max(mx, Size - siz[u]);
  return min(ans, make_pair(mx, u));
}
double calc(int u, int dep, int fa) {
  double ans = sqrt(dep) * dep * a[u];
  f[Size] += sqrt(dep) * a[u];
  for (int i = h[u]; i; i = pre[i])
    if (e[i] != fa) ans += calc(e[i], dep + w[i], u);
  return ans;
}
void solve(int u, int _) {
  Size = _, vis[u = dfs(u).second] = 1;
  double sum = 0, t = 0;
  for (int i = h[u]; i; i = pre[i])
    f[Size = e[i]] = 0, t += calc(e[i], w[i], u), sum += f[e[i]];
  if (t < Ans) Ans = t, ans = u;
  for (int i = h[u]; i; i = pre[i])
    if (!vis[e[i]])
      if (f[e[i]] * 2 > sum)
        solve(e[i], siz[e[i]] < siz[u] ? siz[e[i]] : _ - siz[u]);
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%d", a + i);
  for (int i = 1, x, y, z; i < n; ++i)
    scanf("%d%d%d", &x, &y, &z), add(x, y, z), add(y, x, z);
  Ans = 1e100, solve(1, n);
  printf("%d %.10lf\n", ans, Ans);
  return 0;
}
