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 N = 2e5 + 7;
template <class I>
inline void read(I &x) {
  int f = 1;
  char c;
  for (c = getchar(); c < '0' || c > '9'; c = getchar())
    if (c == '-') f = -1;
  for (x = 0; c >= '0' && c <= '9';
       x = (x << 3) + (x << 1) + (c & 15), c = getchar())
    ;
  x *= f;
}
int n, w[N];
int head[N], nxt[2 * N], ver[2 * N], edge[2 * N], tot = 1;
inline void add(int x, int y, int z) {
  ver[++tot] = y, edge[tot] = z, nxt[tot] = head[x], head[x] = tot;
}
double res = 0;
int rt = 0, d[N], sz;
bool v[N];
void getsz(int x, int f) {
  d[x] = 1;
  for (int i = head[x]; i; i = nxt[i]) {
    int y = ver[i];
    if (v[y] || y == f) continue;
    getsz(y, x);
    d[x] += d[y];
  }
}
void getrt(int x, int f) {
  d[x] = 1;
  int mx = 0;
  for (int i = head[x]; i; i = nxt[i]) {
    int y = ver[i];
    if (v[y] || y == f) continue;
    getrt(y, x);
    d[x] += d[y];
    if (d[y] > mx) mx = d[y];
  }
  mx = max(mx, sz - d[x]);
  if (mx <= sz / 2) rt = x;
}
double ds[N];
void calc(int o, int x, int fa, int dis) {
  res += (double)pow(dis, 1.5) * w[x];
  ds[o] += 1.5 * pow(dis, 0.5) * w[x];
  for (int i = head[x]; i; i = nxt[i]) {
    int y = ver[i];
    if (y == fa) continue;
    calc(o, y, x, dis + edge[i]);
  }
}
int anss;
double ans = 1e20;
void dfs(int x) {
  getsz(x, 0);
  sz = d[x];
  getrt(x, 0);
  if (v[x]) return;
  v[x = rt] = 1;
  res = 0;
  double sds = 0;
  for (int i = head[x]; i; i = nxt[i]) {
    int y = ver[i];
    ds[y] = 0;
    calc(y, y, x, edge[i]);
    sds += ds[y];
  }
  if (ans > res) ans = res, anss = x;
  for (int i = head[x]; i; i = nxt[i]) {
    int y = ver[i];
    if (sds - 2 * ds[y] >= 0) continue;
    dfs(y);
    return;
  }
}
int main() {
  read(n);
  for (int i = 1; i <= n; i++) read(w[i]);
  for (int i = 1; i < n; i++) {
    int x, y, z;
    read(x), read(y), read(z);
    add(x, y, z);
    add(y, x, z);
  }
  dfs(1);
  printf("%d %.7f\n", anss, ans);
  return 0;
}
