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 N = 5e5;
int size[N], vis[N], fst[N], nxt[N], ansu, w[N], mm, n, m, nn, mxsize, root;
double anss = 1e60, d[N], s;
struct Edge {
  int v, w;
} e[N];
void ade(int u, int v, int w) {
  e[++mm] = (Edge){v, w}, nxt[mm] = fst[u], fst[u] = mm;
}
void findroot(int u, int fa, int nn) {
  size[u] = 1;
  int mx = 0;
  for (int i = fst[u]; i; i = nxt[i]) {
    int v = e[i].v;
    if (v == fa || vis[v]) continue;
    findroot(v, u, nn), size[u] += size[v];
    mx = max(mx, size[v]);
  }
  mx = max(mx, nn - size[u]);
  if (mx < mxsize) root = u, mxsize = mx;
}
void calc(int u, int fa, int dep, int anc) {
  d[anc] += sqrt(dep) * w[u];
  s += sqrt(dep) * dep * w[u];
  for (int i = fst[u]; i; i = nxt[i]) {
    int v = e[i].v;
    if (v == fa) continue;
    calc(v, u, dep + e[i].w, anc);
  }
}
void solve(int u) {
  vis[u] = 1;
  s = 0;
  double sd = 0;
  for (int i = fst[u]; i; i = nxt[i]) {
    int v = e[i].v;
    calc(v, u, e[i].w, v);
    sd += d[v];
  }
  if (s < anss) anss = s, ansu = u;
  for (int i = fst[u]; i; i = nxt[i]) {
    int v = e[i].v;
    if (vis[v]) continue;
    if (sd - 2 * d[v] >= 0) continue;
    mxsize = 1e9, findroot(v, u, size[v]), solve(v);
    return;
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", w + i);
  for (int i = 1, u, v, w; i < n; i++)
    scanf("%d%d%d", &u, &v, &w), ade(u, v, w), ade(v, u, w);
  mxsize = 1e9, findroot(1, 0, n), solve(root);
  printf("%d %.10lf\n", ansu, anss);
}
