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 oo = 2139063143;
const int N = 1010000;
const int P = 1000000007;
const double eps = 1e-7;
template <typename T>
inline void sc(T &x) {
  x = 0;
  static int p;
  p = 1;
  static char c;
  c = getchar();
  while (!isdigit(c)) {
    if (c == '-') p = -1;
    c = getchar();
  }
  while (isdigit(c)) {
    x = (x << 1) + (x << 3) + (c - 48);
    c = getchar();
  }
  x *= p;
}
template <typename T>
inline void print(T x) {
  if (x < 0) putchar('-'), x = -x;
  if (x >= 10) print(x / 10);
  putchar(x % 10 + '0');
}
template <typename T>
inline void pr(T x) {
  print(x), putchar('\n');
}
template <typename T1, typename T2>
void chkmax(T1 &A, T2 B) {
  A = A >= B ? A : B;
}
template <typename T1, typename T2>
void chkmin(T1 &A, T2 B) {
  A = A <= B ? A : B;
}
struct EDGE {
  int v, w, nx;
} lb[N << 1];
int tot = 1, top[N];
void add(int u, int v, int w) {
  lb[++tot] = (EDGE){v, w, top[u]}, top[u] = tot;
}
bool vis[N];
int siz[N], masiz[N];
int st[N], z = 0;
void dfsiz(int u) {
  st[++z] = u;
  vis[u] = 1;
  siz[u] = 1, masiz[u] = 0;
  for (int kb = top[u]; kb; kb = lb[kb].nx) {
    int v = lb[kb].v;
    if (vis[v]) continue;
    dfsiz(v);
    siz[u] += siz[v];
    if (siz[v] > masiz[u]) masiz[u] = siz[v];
  }
  vis[u] = 0;
}
int a[N];
double sum = 0, d[N];
void dfs(int u, int fa, int rt, int dis) {
  sum += pow(dis, 1.5) * a[u], d[rt] += 1.5 * sqrt(dis) * a[u];
  for (int kb = top[u]; kb; kb = lb[kb].nx) {
    int v = lb[kb].v;
    if (v == fa) continue;
    dfs(v, u, rt, dis + lb[kb].w);
  }
}
int pos = 0;
double ans = 1e18;
void solve(int u) {
  z = 0;
  dfsiz(u);
  int s = siz[u], mi = masiz[u];
  for (int i = 1; i <= z; i++) {
    int v = st[i], ma = max(masiz[u], s - siz[u]);
    if (ma < mi) mi = ma, u = v;
  }
  vis[u] = 1;
  sum = 0;
  double sd = 0;
  for (int kb = top[u]; kb; kb = lb[kb].nx) {
    int v = lb[kb].v;
    d[v] = 0;
    dfs(v, u, v, lb[kb].w);
    sd += d[v];
  }
  if (sum < ans) pos = u, ans = sum;
  for (int kb = top[u]; kb; kb = lb[kb].nx) {
    int v = lb[kb].v;
    if (sd - 2 * d[v] < 0 && !vis[v]) return solve(v), void();
  }
}
int main() {
  int n;
  sc(n);
  for (int i = 1; i <= n; i++) sc(a[i]);
  for (int i = 1; i < n; i++) {
    int x, y, w;
    sc(x), sc(y), sc(w);
    add(x, y, w), add(y, x, w);
  }
  solve(1);
  printf("%d %.9lf\n", pos, ans);
  return 0;
}
