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 MAXN = 200010;
struct edge {
  int ne, to, w;
  edge(int N = 0, int T = 0, int W = 0) : ne(N), to(T), w(W) {}
} e[MAXN];
int fir[MAXN], num = 0;
inline void join(int a, int b, int c) {
  e[++num] = edge(fir[a], b, c);
  fir[a] = num;
}
int n, a[MAXN];
int siz[MAXN], maxp[MAXN], root;
bool vis[MAXN];
void fdRoot(int u, int fa, const int tots) {
  siz[u] = 1;
  maxp[u] = 0;
  for (int i = fir[u]; i; i = e[i].ne) {
    int v = e[i].to;
    if (v == fa || vis[v]) continue;
    fdRoot(v, u, tots);
    siz[u] += siz[v];
    maxp[u] = max(maxp[u], siz[v]);
  }
  maxp[u] = max(maxp[u], tots - siz[u]);
  if (!root || maxp[u] < maxp[root]) root = u;
}
double f[MAXN], sum, ansval;
int ansid;
void calc(int u, int fa, int d, const int rt) {
  f[rt] += 3.0 / 2.0 * a[u] * sqrt(d);
  sum += 1.0 * a[u] * d * sqrt(d);
  for (int i = fir[u]; i; i = e[i].ne) {
    int v = e[i].to;
    if (v == fa) continue;
    calc(v, u, d + e[i].w, rt);
  }
}
void dfs(int u) {
  if (vis[u]) return;
  vis[u] = 1;
  sum = 0;
  for (int i = fir[u]; i; i = e[i].ne) {
    int v = e[i].to;
    f[v] = 0;
    calc(v, u, e[i].w, v);
    f[u] += f[v];
  }
  if (ansval > sum) ansid = u, ansval = sum;
  for (int i = fir[u]; i; i = e[i].ne) {
    int v = e[i].to;
    if (f[u] < f[v] * 2) {
      root = 0;
      fdRoot(v, u, siz[v]);
      dfs(root);
      break;
    }
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", a + i);
  for (int i = 1; i < n; i++) {
    int u, v, w;
    scanf("%d%d%d", &u, &v, &w);
    join(u, v, w);
    join(v, u, w);
  }
  ansval = 1e12;
  root = 0;
  fdRoot(1, 0, n);
  dfs(root);
  printf("%d %.7lf\n", ansid, ansval);
  return 0;
}
