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;
int n, dis[205000], head[205000], vis[205000], sz[205000], vl, tp, as, as1,
    v[205000], a, b, c, cnt;
double su[205000], su2[205000], as2 = 1e25;
struct edge {
  int t, next, l;
} ed[205000 * 2];
void adde(int f, int t, int l) {
  ed[++cnt] = (edge){t, head[f], l};
  head[f] = cnt;
  ed[++cnt] = (edge){f, head[t], l};
  head[t] = cnt;
}
void dfs1(int u, int fa) {
  sz[u] = 1;
  int mx = 0;
  for (int i = head[u]; i; i = ed[i].next)
    if (!vis[ed[i].t] && ed[i].t != fa)
      dfs1(ed[i].t, u), mx = max(mx, sz[ed[i].t]), sz[u] += sz[ed[i].t];
  mx = max(mx, vl - sz[u]);
  if (mx < tp) tp = mx, as = u;
}
void dfs2(int u, int fa) {
  su[u] = pow(dis[u], 1.5) * v[u];
  su2[u] = pow(dis[u], 0.5) * v[u];
  for (int i = head[u]; i; i = ed[i].next)
    if (ed[i].t != fa)
      dis[ed[i].t] = dis[u] + ed[i].l, dfs2(ed[i].t, u), su[u] += su[ed[i].t],
      su2[u] += su2[ed[i].t];
}
void solve(int x) {
  dis[x] = 0;
  dfs2(x, 0);
  vis[x] = 1;
  if (as2 > su[x]) as2 = su[x], as1 = x;
  for (int i = head[x]; i; i = ed[i].next)
    if (su2[x] < 2 * su2[ed[i].t] && !vis[ed[i].t]) {
      dfs1(x, 0);
      tp = 1e7, vl = sz[ed[i].t];
      dfs1(ed[i].t, 0);
      solve(as);
      break;
    }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &v[i]);
  for (int i = 1; i < n; i++) scanf("%d%d%d", &a, &b, &c), adde(a, b, c);
  solve(1);
  printf("%d %.15lf\n", as1, as2);
}
