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>
void read(T &t) {
  t = 0;
  char ch = getchar();
  int f = 1;
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  do {
    (t *= 10) += ch - '0';
    ch = getchar();
  } while ('0' <= ch && ch <= '9');
  t *= f;
}
const int maxn = (2e5) + 10;
int n, N, tot, sz[maxn], mxsz[maxn];
long double w[maxn], len[maxn * 2], ans;
bool vis[maxn];
int head[maxn], nxt[maxn * 2], to[maxn * 2];
void add(int x, int y, int z) {
  tot++;
  nxt[tot] = head[x];
  head[x] = tot;
  to[tot] = y;
  len[tot] = z;
}
int root;
void dfs1(int u, int p) {
  sz[u] = 1;
  for (int i = head[u], v; i; i = nxt[i]) {
    v = to[i];
    if (v == p || vis[v]) continue;
    dfs1(v, u);
    sz[u] += sz[v];
  }
}
void dfs2(int u, int p) {
  mxsz[u] = 0;
  for (int i = head[u], v; i; i = nxt[i]) {
    v = to[i];
    if (v == p || vis[v]) continue;
    dfs2(v, u);
    mxsz[u] = max(mxsz[u], sz[v]);
  }
  mxsz[u] = max(mxsz[u], N - sz[u]);
  if (mxsz[u] <= N / 2) root = u;
}
long double sum, dao, d[maxn];
int S, pos;
void dfs(int u, int p, long double dep) {
  sum += dep * sqrt(dep) * w[u];
  dao += sqrt(dep) * 1.5 * w[u];
  d[S] += sqrt(dep) * 1.5 * w[u];
  for (int i = head[u], v; i; i = nxt[i]) {
    v = to[i];
    if (v != p) dfs(v, u, dep + len[i]);
  }
}
void solve(int u) {
  vis[u] = 1;
  for (int i = head[u], v; i; i = nxt[i]) {
    v = to[i];
    if (vis[v]) continue;
    S = v;
    dfs(v, u, len[i]);
  }
  if (sum < ans) ans = sum, pos = u;
  for (int i = head[u], v; i; i = nxt[i]) {
    v = to[i];
    if (vis[v]) continue;
    if (dao - d[v] * 2 < 0) {
      dfs1(v, u);
      N = sz[v];
      dfs2(v, u);
      solve(v);
      return;
    }
  }
}
int main() {
  read(n);
  for (int i = 1; i <= n; i++) read(w[i]);
  int x, y, z;
  for (int i = 1; i < n; i++) {
    read(x);
    read(y);
    read(z);
    add(x, y, z);
    add(y, x, z);
  }
  ans = 1e20;
  dfs1(1, 0);
  N = n;
  dfs2(1, 0);
  solve(root);
  printf("%d %.7Lf\n", pos, ans);
  return 0;
}
