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;
template <typename T>
T &Read(T &first) {
  static char c;
  while (!isdigit(c = getchar()))
    ;
  first = c - '0';
  while (isdigit(c = getchar())) (first *= 10) += c - '0';
  return first;
}
const int maxn = 200000;
struct edge {
  int id, g, nxt;
  edge() {}
  edge(const int &_id, const int &_g, const int &_nxt)
      : id(_id), g(_g), nxt(_nxt) {}
};
edge e[(maxn << 1) + 5];
int en = 0;
int st[maxn + 5];
inline void add_edge(const int &first, const int &second, const int &z) {
  e[en] = edge(second, z, st[first]), st[first] = en++;
}
inline void del_edge(const int &first, const int &second) {
  for (int *i = st + first; *i != -1; i = &e[*i].nxt)
    if (e[*i].id == second) {
      *i = e[*i].nxt;
      break;
    }
}
int n;
int w[maxn + 5];
int ans;
double ansval;
int sz[maxn + 5];
int Max[maxn + 5];
int all[maxn + 5], alln = 0;
bool vis[maxn + 5];
void pre_dfs(const int &first, const int &f = -1) {
  all[alln++] = first;
  sz[first] = 1;
  Max[first] = 0;
  for (int i = st[first]; i != -1; i = e[i].nxt) {
    const int &second = e[i].id;
    if (second == f) continue;
    if (vis[second]) continue;
    pre_dfs(second, first);
    sz[first] += sz[second];
    Max[first] = max(Max[first], sz[second]);
  }
}
double sum = 0;
int dep[maxn + 5];
int rt;
void dfs(const int &first, const int &f = -1) {
  sum += (double)w[first] * sqrt((double)dep[first]);
  for (int i = st[first]; i != -1; i = e[i].nxt) {
    const int &second = e[i].id;
    if (second == f) continue;
    dep[second] = dep[first] + e[i].g;
    dfs(second, first);
  }
}
void calc(const int &first, const int &f = -1, const int &dep = 0) {
  sum += (double)w[first] * dep * sqrt((double)dep);
  for (int i = st[first]; i != -1; i = e[i].nxt) {
    const int &second = e[i].id;
    if (second == f) continue;
    calc(second, first, dep + e[i].g);
  }
}
void update(const int &first) {
  sum = 0;
  calc(first);
  if (ans == -1 || sum < ansval) ans = first, ansval = sum;
}
void work(const int &rt) {
  ::rt = rt;
  alln = 0;
  pre_dfs(rt);
  int first = -1;
  for (int i = (0), _end_ = (alln); i < _end_; ++i) {
    const int &second = all[i];
    Max[second] = max(Max[second], alln - sz[second]);
    if (first == -1 || Max[second] < Max[first]) first = second;
  }
  update(first);
  if (alln == 1) return;
  int Max = -1;
  double Maxval;
  for (int i = st[first]; i != -1; i = e[i].nxt) {
    const int &second = e[i].id;
    if (vis[second]) continue;
    dep[second] = e[i].g;
    sum = 0;
    dfs(second, first);
    if (Max == -1 || sum > Maxval) Max = second, Maxval = sum;
  }
  vis[first] = 1;
  work(Max);
}
int main() {
  int n;
  scanf("%d", &n);
  memset(st, -1, sizeof st), en = 0;
  for (int i = (0), _end_ = (n); i < _end_; ++i) scanf("%d", w + i);
  for (int i = (0), _end_ = (n - 1); i < _end_; ++i) {
    static int first, second, z;
    scanf("%d%d%d", &first, &second, &z), --first, --second;
    add_edge(first, second, z), add_edge(second, first, z);
  }
  ans = -1;
  work(0);
  printf("%d ", ans + 1);
  printf("%.16f\n", ansval);
  return 0;
}
