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;
char buf[1 << 20], *p1, *p2;
inline int rd() {
  int w = 0, x = 0;
  char ch = 0;
  while (!isdigit(ch)) {
    w |= ch == '-';
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = (x << 3) + (x << 1) + (ch ^ 48);
    ch = getchar();
  }
  return w ? -x : x;
}
const int maxn = 2e5 + 110;
int size[maxn], mx[maxn], w[maxn];
int n, cnt, ans, g, ans1;
int Len[maxn << 1], Next[maxn << 1], End[maxn << 1], Last[maxn];
bool vis[maxn];
double sum, ans2, f[maxn];
inline void addedge(int x, int y, int z) {
  End[++cnt] = y;
  Len[cnt] = z;
  Next[cnt] = Last[x];
  Last[x] = cnt;
}
inline void dfs1(int u, int fa, int tot) {
  size[u] = 1;
  mx[u] = 0;
  for (int i = Last[u]; i; i = Next[i]) {
    if (End[i] != fa && !vis[End[i]]) {
      dfs1(End[i], u, tot);
      size[u] += size[End[i]];
      mx[u] = max(mx[u], size[End[i]]);
    }
  }
  mx[u] = max(mx[u], tot - size[u]);
  if (mx[u] < mx[g]) g = u;
}
inline void dfs2(int u, int fa, int rt, double dis) {
  sum += (double)w[u] * dis * sqrt(dis);
  f[rt] += sqrt(dis) * (double)w[u];
  for (int i = Last[u]; i; i = Next[i])
    if (End[i] != fa) dfs2(End[i], u, rt, dis + (double)Len[i]);
}
inline void solve(int u, int siz) {
  vis[u] = 1;
  sum = 0;
  double M = 0.0;
  for (int i = Last[u]; i; i = Next[i]) {
    f[End[i]] = 0.0;
    dfs2(End[i], u, End[i], (double)Len[i]);
    M += f[End[i]];
  }
  if (sum < ans2) ans1 = u, ans2 = sum;
  for (int i = Last[u]; i; i = Next[i]) {
    if (vis[End[i]]) continue;
    if (M - 2 * f[End[i]] < 0) {
      g = 0;
      int tt = size[End[i]] < size[u] ? size[End[i]] : siz - size[u];
      dfs1(End[i], u, tt);
      solve(g, tt);
      break;
    }
  }
}
int main() {
  n = rd();
  for (int i = 1; i <= n; i++) w[i] = rd();
  int x, y, z;
  for (int i = 1; i < n; i++) {
    x = rd();
    y = rd();
    z = rd();
    addedge(x, y, z);
    addedge(y, x, z);
  }
  mx[0] = 1e100;
  ans2 = (double)1e100;
  g = 0;
  dfs1(1, 0, n);
  solve(g, n);
  printf("%d %.20lf", ans1, ans2);
  return 0;
}
