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 nn = 2e5 + 5;
int N, ans1;
double ans2;
int a[nn];
int cnt, End[nn << 1], Prev[nn << 1], Last[nn], len[nn << 1];
inline void make_line(int p, int q, int r) {
  cnt++;
  Prev[cnt] = Last[p];
  Last[p] = cnt;
  End[cnt] = q;
  len[cnt] = r;
}
int vis[nn], g;
int Size[nn];
void findzx(int p, int fa, int tot) {
  Size[p] = 1;
  int max_size = 0;
  for (int i = Last[p]; i; i = Prev[i]) {
    int q = End[i];
    if (!vis[q] && q != fa) {
      findzx(q, p, tot);
      Size[p] += Size[q];
      max_size = max(max_size, Size[q]);
    }
  }
  max_size = max(max_size, tot - Size[p]);
  g = (max_size << 1) <= tot ? p : g;
}
double cou[nn], sqrt_dis[nn];
int dis[nn];
void dfs(int p, int fa) {
  cou[p] = 0;
  sqrt_dis[p] = sqrt(dis[p]);
  for (int i = Last[p], q; i; i = Prev[i]) {
    q = End[i];
    if (q != fa) {
      dis[q] = dis[p] + len[i];
      dfs(q, p);
      cou[p] += cou[q];
    }
  }
  cou[p] += sqrt_dis[p] * a[p];
  return;
}
void solve(int p, int tot) {
  g = 0;
  findzx(p, 0, tot);
  vis[p = g] = 1;
  dis[p] = 0;
  dfs(p, 0);
  double sum = 0;
  for (register int i = 1; i <= N; ++i) sum += sqrt_dis[i] * dis[i] * a[i];
  if (sum < ans2) {
    ans1 = p;
    ans2 = sum;
  }
  for (int i = Last[p], q; i; i = Prev[i]) {
    q = End[i];
    if (cou[p] - 2 * cou[q] < 0)
      solve(End[i], Size[q] < Size[p] ? Size[q] : tot - Size[p]);
  }
}
int main() {
  ans2 = 1e100;
  scanf("%d", &N);
  for (register int i = 1; i <= N; ++i) scanf("%d", a + i);
  for (register int i = 1, p, q, r; i < N; ++i) {
    scanf("%d %d %d", &p, &q, &r);
    make_line(p, q, r);
    make_line(q, p, r);
  }
  solve(1, N);
  printf("%d ", ans1);
  printf("%.7lf", ans2);
  return 0;
}
