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;
char BB[1 << 15], *SS = BB, *TT = BB;
bool fl;
inline long long read() {
  long long x = 0;
  int f = 1;
  char ch = getchar();
  for (; !isdigit(ch); ch = getchar())
    if (ch == '-') f = -1;
  for (; isdigit(ch); ch = getchar()) x = x * 10 + (ch ^ 48);
  return x * f;
}
inline void print(long long x) {
  if (x < 0) {
    putchar('-');
    x = -x;
  }
  char ch = x % 10 + '0';
  if (x > 9) print(x / 10);
  putchar(ch);
}
const int N = 200010;
struct edge {
  int to, nxt, w;
} e[N << 1];
int head[N], cnt;
void add(int u, int v, int w) {
  e[++cnt].w = w, e[cnt].to = v, e[cnt].nxt = head[u];
  head[u] = cnt;
}
void add_edge(int u, int v, int w) { add(u, v, w), add(v, u, w); }
double ans2 = 1e30;
double sum, sumd, d[N];
int n, w[N], siz[N], root, ans1;
bool book[N];
void dfs(int u, int fa, int S) {
  siz[u] = 1;
  int maxx = -1;
  for (int i = head[u]; i; i = e[i].nxt) {
    int v = e[i].to;
    if (book[v] || v == fa) continue;
    dfs(v, u, S);
    maxx = max(maxx, siz[v]);
    siz[u] += siz[v];
  }
  maxx = max(maxx, S - siz[u]);
  if (maxx <= (S >> 1)) root = u;
}
void calc(int u, int fa, int rt, double z) {
  sum += pow(z, 1.5) * w[u], d[rt] += pow(z, 0.5) * 1.5 * w[u];
  for (int i = head[u]; i; i = e[i].nxt) {
    int v = e[i].to;
    if (v == fa) continue;
    calc(v, u, rt, z + e[i].w);
  }
}
void solve(int x, int S) {
  dfs(x, 0, S), x = root, dfs(x, 0, S);
  sum = sumd = 0;
  if (book[x]) return;
  book[x] = 1;
  for (int i = head[x]; i; i = e[i].nxt) {
    int v = e[i].to;
    calc(v, x, v, e[i].w);
    sumd += d[v];
  }
  if (sum < ans2) ans1 = x, ans2 = sum;
  for (int i = head[x]; i; i = e[i].nxt) {
    int v = e[i].to;
    if (sumd - 2.0 * d[v] < 0) {
      solve(v, siz[v]);
      break;
    }
  }
}
int main() {
  n = read();
  for (int i = 1; i <= n; w[i] = read(), i++)
    ;
  for (int i = 1; i < n; i++) {
    int u = read(), v = read(), w = read();
    add_edge(u, v, w);
  }
  solve(1, n);
  print(ans1), putchar(' '), printf("%.10lf", ans2);
  return 0;
}
