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;
inline double F(double v) { return v * sqrt(v); }
int n, w[200010], dep[200010], dis[200010], L[200010], tim, lg2[400010];
pair<int, int> st[400010][19];
vector<pair<int, int> > v[200010];
void dfs1(int np, int fath) {
  dep[np] = dep[fath] + 1;
  L[np] = ++tim;
  st[tim][0] = make_pair(dep[np], np);
  for (auto &x : v[np]) {
    if (x.first == fath) continue;
    dis[x.first] = dis[np] + x.second;
    dfs1(x.first, np);
    ++tim;
    st[tim][0] = make_pair(dep[np], np);
  }
}
inline int getdis(int x, int y) {
  int px = x, py = y;
  x = L[x];
  y = L[y];
  if (x > y) swap(x, y);
  int d = lg2[y - x + 1];
  return dis[px] + dis[py] -
         2 * dis[min(st[x][d], st[y - (1 << d) + 1][d]).second];
}
inline double calc(int p) {
  double ret = 0;
  for (int i = 1; i <= n; i++) ret += F(getdis(i, p)) * w[i];
  return ret;
}
double ans = 1e15;
bool vis[200010];
int fa[200010], siz[200010], rt, mxsiz[200010];
void dfs2(int np, int fath, int totsiz) {
  fa[np] = fath;
  siz[np] = 1;
  mxsiz[np] = 0;
  for (auto &x : v[np]) {
    if (vis[x.first] || x.first == fath) continue;
    dfs2(x.first, np, totsiz);
    siz[np] += siz[x.first];
    mxsiz[np] = max(mxsiz[np], siz[x.first]);
  }
  mxsiz[np] = max(mxsiz[np], totsiz - siz[np]);
  if (rt == -1 || mxsiz[rt] > mxsiz[np]) rt = np;
}
int pos;
void update(double v, int p) {
  if (ans > v) {
    ans = v;
    pos = p;
  }
}
inline void solve(int p, int totsiz) {
  rt = -1;
  dfs2(p, 0, totsiz);
  p = rt;
  vis[p] = 1;
  update(calc(p), p);
  for (auto &x : v[p]) {
    if (vis[x.first]) continue;
    if (calc(x.first) < ans) {
      if (x.first == fa[p])
        solve(x.first, totsiz - siz[p]);
      else
        solve(x.first, siz[x.first]);
      break;
    }
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &w[i]);
  for (int i = 1, ti, tj, tk; i < n; i++) {
    scanf("%d%d%d", &ti, &tj, &tk);
    v[ti].push_back(make_pair(tj, tk));
    v[tj].push_back(make_pair(ti, tk));
  }
  dfs1(1, 0);
  for (int j = 1; j < 19; j++)
    for (int i = 1; i + (1 << j) - 1 <= tim; i++)
      st[i][j] = min(st[i][j - 1], st[i + (1 << (j - 1))][j - 1]);
  for (int i = 2; i <= tim; i++) lg2[i] = lg2[i >> 1] + 1;
  solve(1, n);
  printf("%d %.10lf\n", pos, ans);
  return 0;
}
