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 = 200005;
template <typename T>
inline void read(T &AKNOI) {
  T x = 0, flag = 1;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') flag = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  AKNOI = flag * x;
}
template <typename T>
inline void cmin(T &x, T y) {
  if (x > y) x = y;
}
template <typename T>
inline void cmax(T &x, T y) {
  if (x < y) x = y;
}
int n, cnt[MAXN], pos;
int vis[MAXN], siz[MAXN], son[MAXN], tsiz, root;
long long dis[MAXN];
double sum[MAXN], sq, cur, ans;
struct Edge {
  int v, w, nxt;
} e[MAXN << 1];
int first[MAXN], eCnt;
inline void AddEdge(int u, int v, int w) {
  e[++eCnt].v = v;
  e[eCnt].w = w;
  e[eCnt].nxt = first[u];
  first[u] = eCnt;
}
void GetRoot(int u, int fa) {
  siz[u] = 1;
  son[u] = 0;
  for (int i = first[u]; i; i = e[i].nxt) {
    int v = e[i].v;
    if (v == fa || vis[v]) continue;
    GetRoot(v, u);
    cmax(son[u], siz[v]);
    siz[u] += siz[v];
  }
  cmax(son[u], tsiz - siz[u]);
  if (son[u] < son[root]) root = u;
}
void GetCost(int u, int fa) {
  sq = sqrt(dis[u]) * cnt[u];
  sum[u] = sq;
  cur += sq * dis[u];
  for (int i = first[u]; i; i = e[i].nxt) {
    int v = e[i].v;
    if (v == fa) continue;
    dis[v] = dis[u] + e[i].w;
    GetCost(v, u);
    sum[u] += sum[v];
  }
}
void PointDC(int u) {
  vis[u] = 1;
  cur = dis[u] = 0;
  GetCost(u, 0);
  if (cur < ans) {
    ans = cur;
    pos = u;
  }
  for (int i = first[u]; i; i = e[i].nxt) {
    int v = e[i].v;
    if (vis[v]) continue;
    if (sum[u] < sum[v] * 2) {
      tsiz = siz[v];
      root = 0;
      GetRoot(v, 0);
      PointDC(root);
      break;
    }
  }
}
void init() {
  read(n);
  for (int i = 1; i <= n; ++i) {
    read(cnt[i]);
  }
  for (int i = 1, u, v, w; i < n; ++i) {
    read(u);
    read(v);
    read(w);
    AddEdge(u, v, w);
    AddEdge(v, u, w);
  }
}
void solve() {
  ans = 1e30;
  son[0] = tsiz = n;
  GetRoot(1, 0);
  PointDC(root);
  printf("%d %.8lf\n", pos, ans);
}
int main() {
  init();
  solve();
  return 0;
}
