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 int MAXN = 2e5 + 5;
int N, w[MAXN];
struct node {
  int v, next, k;
} E[MAXN << 1];
int head[MAXN], Elen;
void add(int u, int v, int k) {
  ++Elen, E[Elen].v = v, E[Elen].next = head[u], head[u] = Elen, E[Elen].k = k;
}
bool vis[MAXN];
int Sum, Rt, Maxpart, siz[MAXN];
void getRt(int u, int ff) {
  siz[u] = 1;
  int maxpart = 0;
  for (int i = head[u]; i; i = E[i].next)
    if (!vis[E[i].v] && E[i].v != ff) {
      getRt(E[i].v, u), siz[u] += siz[E[i].v],
          maxpart = max(maxpart, siz[E[i].v]);
    }
  maxpart = max(maxpart, Sum - siz[u]);
  if (maxpart < Maxpart) Maxpart = maxpart, Rt = u;
}
int dep[MAXN];
double f[MAXN], h[MAXN], hans = 1e100;
int ans;
void dfs(int u, int ff) {
  f[u] = pow(dep[u], 0.5) * w[u], h[u] = pow(dep[u], 1.5) * w[u];
  for (int i = head[u]; i; i = E[i].next)
    if (E[i].v != ff) {
      dep[E[i].v] = dep[u] + E[i].k, dfs(E[i].v, u);
      f[u] += f[E[i].v], h[u] += h[E[i].v];
    }
}
void Solve() {
  vis[Rt] = 1, dep[Rt] = 0, dfs(Rt, 0);
  int mxson = 0;
  for (int i = head[Rt]; i; i = E[i].next)
    if (!vis[E[i].v]) {
      if (-f[E[i].v] + f[Rt] - f[E[i].v] < 0) mxson = E[i].v;
    }
  if (h[Rt] < hans) ans = Rt, hans = h[Rt];
  if (mxson) Maxpart = 1e9, Sum = siz[Rt], Rt = 0, getRt(mxson, 0), Solve();
}
int main() {
  scanf("%d", &N);
  for (int i = 1; i <= N; ++i) scanf("%d", &w[i]);
  int u, v, k;
  for (int i = 1; i < N; ++i)
    scanf("%d%d%d", &u, &v, &k), add(u, v, k), add(v, u, k);
  Sum = N, Maxpart = 1e9, getRt(1, 0);
  Solve();
  printf("%d %.8f\n", ans, hans);
  return 0;
}
