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 = 200010, MaxM = MaxN * 2;
const double Inf = 1e100;
int En[MaxN], Next[MaxM], Point[MaxM], Tot, V[MaxM], Val[MaxN], SumTime;
bool Mark[MaxN];
int N, AnsPos;
double Ans, AnsNow, Sum[MaxN];
bool Vis[MaxN];
void Add(int X, int Y, int Z) {
  Next[++Tot] = En[X];
  En[X] = Tot;
  Point[Tot] = Y;
  V[Tot] = Z;
}
int Find(int Now) {
  static int H[MaxN], Size[MaxN], Time[MaxN], F[MaxN];
  int L = 0, R = 1;
  H[R] = Now;
  Time[Now] = SumTime;
  F[Now] = 0;
  while (L++ != R) {
    Size[H[L]] = 1;
    for (int i = En[H[L]]; i; i = Next[i])
      if ((Time[Point[i]] != SumTime) && !Mark[Point[i]]) {
        H[++R] = Point[i];
        Time[Point[i]] = SumTime;
        F[Point[i]] = H[L];
      }
  }
  for (int i = R; i; i--) Size[F[H[i]]] += Size[H[i]];
  int Sum = Size[H[1]], Min = Sum, Pos = Now;
  for (int i = 1; i <= R; i++) {
    int T = Sum - 1, X = 0;
    for (int j = En[H[i]]; j; j = Next[j])
      if ((Time[Point[j]] == SumTime) && (F[H[i]] != Point[j])) {
        T -= Size[Point[j]];
        X = max(Size[Point[j]], X);
      }
    X = max(X, T);
    if (X < Min) {
      Min = X;
      Pos = H[i];
    }
  }
  return Pos;
}
void Dfs(int Now, int Root, int Deep) {
  Vis[Now] = 1;
  AnsNow += Deep * sqrt(Deep) * Val[Now];
  Sum[Root] += sqrt(Deep) * Val[Now];
  for (int i = En[Now]; i; i = Next[i])
    if (!Vis[Point[i]]) Dfs(Point[i], Root, Deep + V[i]);
  Vis[Now] = 0;
}
int GetAns(int Now) {
  memset(Vis, 0, sizeof(Vis));
  memset(Sum, 0, sizeof(Sum));
  Vis[Now] = 1;
  AnsNow = 0;
  int NowPos = -1;
  for (int i = En[Now]; i; i = Next[i]) Dfs(Point[i], Point[i], V[i]);
  if (AnsNow < Ans) {
    Ans = AnsNow;
    AnsPos = Now;
  }
  double Max = -Inf;
  for (int i = En[Now]; i; i = Next[i])
    if (Sum[Point[i]] > Max) {
      Max = Sum[Point[i]];
      NowPos = Point[i];
    }
  return NowPos;
}
void Divide(int Now) {
  ++SumTime;
  Now = Find(Now);
  Mark[Now] = 1;
  int P = GetAns(Now);
  if (P == -1)
    return;
  else if (!Mark[P])
    Divide(P);
}
int main() {
  Ans = Inf;
  scanf("%d", &N);
  for (int i = 1; i <= N; i++) scanf("%d", &Val[i]);
  for (int i = 1; i < N; i++) {
    int U, V, W;
    scanf("%d%d%d", &U, &V, &W);
    Add(U, V, W);
    Add(V, U, W);
  }
  Divide(N);
  printf("%d %.15lf\n", AnsPos, Ans);
  return 0;
}
