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>
template <class T, class U>
inline bool smin(T &x, const U &y) {
  return y < x ? x = y, 1 : 0;
}
template <class T, class U>
inline bool smax(T &x, const U &y) {
  return x < y ? x = y, 1 : 0;
}
constexpr int N(2e5 + 5);
int n, a[N], head[N];
struct Edge {
  int v, w, next;
} e[N << 1];
void addEdge(int x, int y, int z) {
  static int c = 0;
  e[++c] = {y, z, head[x]}, head[x] = c;
  e[++c] = {x, z, head[y]}, head[y] = c;
}
bool vis[N];
int rt, tSize, mSize, siz[N];
void getSize(int x, int fa) {
  siz[x] = 1;
  for (int i = head[x]; i; i = e[i].next) {
    int y = e[i].v;
    if (y == fa || vis[y]) continue;
    getSize(y, x);
    siz[x] += siz[y];
  }
}
void findrt(int x, int fa) {
  int max = tSize - siz[x];
  for (int i = head[x]; i; i = e[i].next) {
    int y = e[i].v;
    if (y == fa || vis[y]) continue;
    findrt(y, x);
    smax(max, siz[y]);
  }
  if (smin(mSize, max)) rt = x;
}
double ans = 1e18, f, diff;
int pos;
void dfs(int x, int fa, int d) {
  f += a[x] * sqrt(d) * d, diff += a[x] * sqrt(d);
  for (int i = head[x]; i; i = e[i].next) {
    int y = e[i].v;
    if (y == fa) continue;
    dfs(y, x, d + e[i].w);
  }
}
void solve(int x) {
  if (vis[x]) return;
  vis[x] = 1;
  int p;
  double s = 0, m = 0;
  f = 0;
  for (int i = head[x]; i; i = e[i].next) {
    int y = e[i].v;
    diff = 0;
    dfs(y, x, e[i].w);
    if (smax(m, diff)) p = y;
    s += diff;
  }
  if (smin(ans, f)) pos = x;
  if (m * 2 > s && !vis[p]) {
    getSize(p, 0);
    tSize = mSize = siz[p];
    if (!tSize) return;
    findrt(p, 0);
    solve(rt);
  }
}
int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  std::cin >> n;
  for (int i = 1; i <= n; i++) std::cin >> a[i];
  for (int i = 1, x, y, z; i < n; i++) {
    std::cin >> x >> y >> z;
    addEdge(x, y, z);
  }
  getSize(1, 0), tSize = mSize = n, findrt(1, 0), solve(rt);
  printf("%d %.10f", pos, ans);
  return 0;
}
